# US 12,118,197 B2 · User interface, programmer and/or debugger for embedding and/or modifying problems on quantum processors > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,118,197 B2 - Document ID: US12118197B2 - Status: Granted - Kind: B2 - Application number: 18/205,379 - Filed: 2023-06-02 - Published: 2024-04-11 - Granted: 2024-10-15 - Earliest claimed: 2020-02-24 - Assignees: D-Wave Systems Inc. - Applicants: D-Wave Systems Inc. - Inventors: Murray C. Thom; Fiona L. Hanington; Alexander Condello; William W. Bernoudy; Melody C. Wong; Aidan P. Roy; Kelly T. R. Boothby; Edward D. Dahl - Web page: https://patentgrep.com/patent/US12118197B2 ## CPC - G06F 3/04847: Interaction techniques to control parameter settings, e.g. interaction with sliders or dials - G06F 16/901: Indexing; Data structures therefor; Storage structures (for retrieval from the web G06F16/951) - G06F 3/04817: using icons (graphical or visual programming using iconic symbols G06F8/34) - G06F 8/34: Graphical or visual programming - G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)} - G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers - G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control - G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms - G06N 10/80: Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing - G06T 11/26: Drawing of charts or graphs - G06T 2200/24: involving graphical user interfaces [GUIs] - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL ## Abstract A user interface (UI), data structures and algorithms facilitate programming, analyzing, debugging, embedding, and/or modifying problems that are embedded or to be embedded on an analog processor (e.g., quantum processor), increasing computational efficiency and/or accuracy of problem solutions. The UI provides graph representations (e.g., source graph, target graph and correspondence therebetween) with nodes and edges which may map to hardware components (e.g., qubits, couplers) of the analog processor. Characteristics of solutions are advantageously represented spatially associated (e.g., overlaid or nested) with characteristics of a problem. Characteristics (e.g., bias state) may be represented by color, pattern, values, icons. Issues (e.g., broken chains) may be detected and alerts provided. Problem representations may be modified via the UI, and a computer system may autonomously generate new instances of the problem representation, update data structures, embed the new instance and cause the new instance to be executed by the analog processor. ## Claims ### Claim 1 A method of providing a user interface for use with a quantum processor-based system that comprises a quantum processor including a plurality of physical qubits and a plurality of couplers, each of the couplers operable to set a coupling strength between a respective pair of the physical qubits, the method executable by at least one processor that executes processor-executable instructions, the method comprising: generating a source graph representation of a first instance of a problem, the source graph representation including a set of nodes and edges, each of the edges extending between a respective pairs of the nodes, each of two or more of the nodes in the source graph representation representing a respective variable of a logical problem and having corresponding problem information and corresponding solution information logically associated therewith; and generating a target graph representation of the first instance of the problem, the target graph representation including a set of nodes and edges, each of the edges extending between a respective pairs of the nodes, each of two or more of the nodes in the target graph representation representing a respective physical or logical qubit of the quantum processor; and causing a concurrent visual presentation of the source graph representation and the target graph representation of the first instance of the problem. ### Claim 2 (depends on 1) The method of claim 1 wherein each node of the source graph representation of the first instance of the problem represents both problem information and solution information for the respective variable that the node represents, and causing a concurrent visual presentation of the source graph representation and the target graph representation of the first instance of the problem include causing the concurrent presentation with both problem and solution information visually represented for each node of the source graph representation. ### Claim 3 (depends on 1) The method of claim 1, further comprising: in response to a selection of one of the nodes of the source graph representation of the first instance of the problem, identifying a corresponding node in the target graph representation of the first instance of the problem; and presenting a visual identification of the corresponding node in the target graph representation of the first instance of the problem. ### Claim 4 (depends on 1) The method of claim 1, further comprising: in response to a selection of one of the nodes of the target graph representation of the first instance of the problem, identifying a corresponding node in the source graph representation of the first instance of the problem; and presenting a visual identification of the corresponding node in the source graph representation of the first instance of the problem. ### Claim 5 (depends on 1) The method of claim 1, wherein causing a concurrent visual presentation of the source graph representation and the target graph representation includes causing a visual representation of the nodes of the source graph representation with a visual indication that identifies a programmed bias state of a corresponding variable. ### Claim 6 (depends on 1) The method of claim 1, wherein generating a target graph representation of the first instance of the problem comprises generating a quantum processor graph in which the nodes represent respective physical qubits of the plurality of physical qubits and the edges represent respective couplers of the plurality of couplers. ### Claim 7 (depends on 6) The method of claim 6, wherein causing a concurrent visual presentation of the source graph representation and the target graph representation includes causing a visual representation of the nodes of the target graph representation with a visual indication that identifies a programmed bias state of a corresponding one of the qubits that the respective node represents. ### Claim 8 (depends on 6) The method of claim 6, further comprising: in response to a selection of one of the nodes of the target graph representation of the first instance of the problem, identifying a corresponding variable of the logical problem; and presenting a visual identification of all corresponding nodes and edges in the target graph representation of the first instance of the problem that map to the corresponding variable of the logical problem. ### Claim 9 (depends on 6) The method of claim 6, wherein causing a concurrent visual presentation of the source graph representation and the target graph representation of the first instance of the problem includes causing a visual representation of the nodes with a visual anomalous condition indication that identifies an anomalous condition that has been detected. ### Claim 10 (depends on 9) The method of claim 9, wherein causing a visual presentation of the graph representation includes causing a visual representation of the nodes with a visual anomalous condition indication that indicates one or more of: a chain length specified in the first instance of the problem that exceeds a chain length threshold and an existence of a broken chain. ### Claim 11 A system to provide a user interface for use with a quantum processor-based system that comprises a quantum processor including a plurality of physical qubits and a plurality of couplers, each of the couplers operable to set a coupling strength between a respective pair of the plurality of physical qubits, the system comprising: at least one processor; at least one nontransitory processor-readable medium that stores processor-executable instructions, which when executed by at least one processor, cause the at least one processor to: generate a source graph representation of a first instance of a problem, the source graph representation including a set of nodes and edges, each of the edges extending between a respective pairs of the nodes, each of two or more of the nodes in the source graph representation representing a respective variable of a logical problem and having corresponding problem information and corresponding solution information logically associated therewith; and generate a target graph representation of the first instance of the problem, the target graph representation including a set of nodes and edges, each of the edges extending between a respective pairs of the nodes, each of two or more of the nodes in the target graph representation representing a respective physical or logical qubit of the quantum processor; and cause a concurrent visual presentation of the source graph representation and the target graph representation of the first instance of the problem. ### Claim 12 (depends on 11) The system of claim 11 wherein each node of the source graph representation of the first instance of the problem represents both problem information and solution information for the respective variable that the node represents. ### Claim 13 (depends on 11) The system of claim 11, wherein the processor-executable instructions further cause the at least one processor to: in response to a selection of one of the nodes of the source graph representation of the first instance of the problem, identify a corresponding node in the target graph representation of the first instance of the problem; and present a visual identification of the corresponding node in the target graph representation of the first instance of the problem. ### Claim 14 (depends on 11) The system of claim 11, wherein the processor-executable instructions further cause the at least one processor to: in response to a selection of one of the nodes of the target graph representation of the first instance of the problem, identify a corresponding node in the source graph representation of the first instance of the problem; and present a visual identification of the corresponding node in the source graph representation of the first instance of the problem. ### Claim 15 (depends on 14) The system of claim 14, wherein the concurrent visual presentation of the source graph representation and the target graph representation includes a visual representation of the nodes of the source graph representation with a visual indication that identifies a programmed bias state of a corresponding variable. ### Claim 16 (depends on 14) The system of claim 14, wherein the target graph representation of the first instance of the problem comprises a quantum processor graph in which the nodes represent respective physical qubits of the plurality of physical qubits and the edges represent respective couplers of the plurality of couplers. ### Claim 17 (depends on 16) The system of claim 16, wherein the concurrent visual presentation of the source graph representation and the target graph representation includes a visual representation of the nodes of the target graph representation with a visual indication that identifies a programmed bias state of a corresponding one of the qubits that the respective node represents. ### Claim 18 (depends on 16) The system of claim 16, wherein the processor-executable instructions further cause the at least one processor to: in response to a selection of one of the nodes of the target graph representation of the first instance of the problem, identify a corresponding variable of the logical problem; and present a visual identification of all corresponding nodes and edges in the target graph representation of the first instance of the problem that map to the corresponding variable of the logical problem. ### Claim 19 (depends on 16) The system of claim 16, wherein the concurrent visual presentation of the source graph representation and the target graph representation of the first instance of the problem includes a visual representation of the nodes with a visual anomalous condition indication that identifies an anomalous condition that has been detected. ### Claim 20 (depends on 19) The system of claim 19, wherein the visual presentation of the graph representation includes causing a visual representation of the nodes with a visual anomalous condition indication that indicates one or more of: a chain length specified in the first instance of the problem that exceeds a chain length threshold and an existence of a broken chain.