International Business Machines Corporation

Ali Javadiabhari

Jay Michael Gambetta

David C Mckay

Marco Pistoia

Andrew W Cross

Ismael Faro Sertage

Richard Chen

Dmitri Maslov

Don Greenberg

Francisco Jose Martin Fernandez

Paul Nation

David Louis Kaminsky

Mark N Wegman

John A Gunnels

Scott Douglas Lekuch

Ken Inoue

Prakash Murali

Luciano Bello

Lev Samuel Bishop

Peng Liu

Eric Peterson

Ji Liu

A method for a classical computer to synthesize a quantum circuit for use on a quantum computational device includes receiving information for a target operation to be implemented on said quantum computational device, and receiving information regarding native qubit gates that are available on said quantum computational device to be used to implement said quantum circuit; The method further includes determining each of a plurality of quantum circuits formed from said native qubit gates such that each of said plurality of quantum circuits will perform a function substantially equivalent to said target operation when implemented on the quantum computational device. The method further includes selecting one of said plurality of quantum circuits formed from said native qubit gates, based on a performance criterion of said quantum computational device.

Synthesis of quantum circuits from native gates

Systems, computer-implemented methods, and computer program products to facilitate evaluation of quantum circuit optimization routines and knowledge base generation are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components can comprise a compilation component that concurrently executes different quantum circuit optimization sequences on multiple copies of a quantum circuit. The computer executable components can further comprise an identification component that identifies at least one of the different quantum circuit optimization sequences that generates an output quantum circuit comprising defined criteria.

Quantum circuit optimization routine evaluation and knowledge base generation

A quantum circuit generator for a quantum computer includes a controller; and a plurality of analog conversion units (ACUs) operatively connected to the controller, each ACU being operatively connected to a corresponding qubit of a plurality of qubits, wherein each ACU is configured to convert a digital input from the controller into an analog input at a microwave frequency to control a quantum state of the corresponding qubit. The controller is configured to generate a quantum circuit using at least two qubits of the plurality of qubits, the at least two qubits being selected by the controller based on corresponding classical bits being mapped by the controller and based on latency of the generated quantum circuit so that the generated quantum circuit has a latency less than a threshold latency.

System and method for latency-aware mapping of quantum circuits to quantum chips

A method for validation and runtime estimation of a quantum algorithm includes receiving a quantum algorithm and simulating the quantum algorithm, the quantum algorithm forming a set of quantum gates. The method further includes analyzing a first set of parameters of the set of quantum gates and analyzing a second set of parameters of a set of qubits performing the set of quantum gates. The method further includes transforming, in response to determining at least one of the first set of parameters or the second set of parameters meets an acceptability criterion, the quantum algorithm into a second set of quantum gates.

Validating and estimating runtime for quantum algorithms

Systems, computer-implemented methods and/or computer program products are provided to facilitate operation of a quantum circuit on a set of qubits via providing and implementing decompositions of one or more unitary matrices. According to an embodiment, a system can implement a unitary matrix by providing and implementing a decomposition of the unitary matrix, to thereby facilitate operation of and/or operate a quantum circuit on a set of qubits. The system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a unitary matrix management component that decomposes a defined 4×4 unitary matrix into a defined circuit comprising a sequence of universal gates. The sequence of universal gates can be a same sequence for each defined 4×4 unitary matrix of a set of candidate 4×4 unitary matrices including the defined 4×4 unitary matrix.

Enhanced quantum circuit operation via a universally implementable 4X4 unitary matrix decomposition

Embodiments are provided for compilation of a quantum program. In some embodiments, a system can include a processor that executes computer-executable components stored in memory. The computer-executable components can include an identification component that selects a subgraph that is common among a first commutation directed acyclic graph (DAG) and a second commutation DAG. The subgraph has an upper-bound size that is greater than a threshold size. The first commutation DAG represents a first quantum circuit of a set of quantum circuits and the second commutation DAG represents a second quantum circuit of the set of quantum circuits. The computer-executable components also include a compilation component that compiles a quantum subcircuit corresponding to the subgraph. The computer-executable components further include a configuration component that replaces the quantum subcircuit in the first quantum circuit with the compiled quantum subcircuit.

Compilation of a quantum program

A repository is configured in a hybrid data processing environment comprising a classical computing system and a quantum computing system, to hold a plurality of quantum circuit components (QCC(s)). A degree of difficulty in simulating the received QCC in the classical computing system is transformed into a classical hardness score. A degree of difficulty in implementing the received QCC in the quantum computing system is transformed into a quantum hardness score. A first parameter in a metadata data structure associated with the received QCC is populated with the classical hardness score. A second parameter in the metadata data structure associated with the received QCC is populated with the quantum hardness score. The received QCC is transformed into a library element by at least augmenting the received QCC with the metadata data structure. The library element is added to the repository.

Providing reusable quantum circuit components as a curated service

Techniques for enhancing quantum circuit execution in a quantum service are presented. Database component stores compiled unitaries associated with quantum functions. Unitary management component (UMC) determines whether to compile a unitary associated with a quantum function for storage in the database component based on a composite quality score associated with the unitary and a threshold composite quality score associated with the quantum function, wherein the threshold score can be, or can be based on, a composite quality score of a compiled unitary that performs the same quantum function or a compiled unitary that performs a different quantum function. UMC determines the composite quality score based on a group of factors comprising frequency of utilizing the quantum function or equivalent quantum function or computation, age of the quantum function or computation, difficulty level of compiling a unitary, quantum circuit quality, or error associated with experimental execution of the quantum function.

Enhanced quantum circuit execution in a quantum service

Systems, computer-implemented methods, and computer program products to facilitate characterizing crosstalk of a quantum computing system based on sparse data collection are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a package component that packs subsets of quantum gates in a quantum device into one or more bins. The computer executable components can further comprise an assessment component that characterizes crosstalk of the quantum device based on a number of the one or more bins into which the subsets of quantum gates are packed.

Characterizing crosstalk of a quantum computing system based on sparse data collection

A method includes detecting submission of a first quantum circuit for compilation, the first quantum circuit comprising a first set of quantum logic gates; generating a first gate index, the first gate index comprising an ordered table of a subset of the set of quantum logic gates, each quantum logic gate of the subset of quantum logic gates including a corresponding set of qubits acted on by the quantum logic gate; comparing the first gate index with a second gate index to determine a structural equality of the first quantum circuit and the second quantum circuit; and parameterizing, in response to determining a structural equality of the first quantum circuit and the second quantum circuit, a first set of parameters of a second set of quantum logic gates of the second quantum circuit with a second set of parameters of the first set of quantum logic gates.

Incremental generation of quantum circuits

Techniques facilitating cached result use through quantum gate rewrite are provided. In one example, a computer-implemented method comprises converting, by a device operatively coupled to a processor, an input quantum circuit to a normalized form, resulting in a normalized quantum circuit; detecting, by the device, a match between the normalized quantum circuit and a cached quantum circuit among a set of cached quantum circuits; and providing, by the device, a cached run result of the cached quantum circuit based on the detecting.

Cached result use through quantum gate rewrite

A method includes executing a calibration operation on a set of qubits, in a first iteration, to produce a set of parameters, a first subset of the set of parameters corresponding to a first qubit of the set of qubits, and a second subset of the set of parameters corresponding to a second qubit of the set of qubits. In an embodiment, the method includes selecting the first qubit, responsive to a parameter of the first subset meeting an acceptability criterion. In an embodiment, the method includes forming a quantum gate, responsive to a second parameter of the second subset failing to meet a second acceptability criterion, using the first qubit and a third qubit.

Noise and calibration adaptive compilation of quantum programs

A hybrid data processing environment comprising a classical computing system and a quantum computing system is configured. A configuration of a first quantum circuit is produced from the classical computing system, the first quantum circuit being executable using the quantum computing system. Using the quantum computing system, the first quantum circuit is executed. Using a pattern recognition technique, a portion of the first quantum circuit that can be transformed using a first transformation operation to satisfy a constraint on the quantum circuit design is identified. The portion is transformed to a second quantum circuit according to the first transformation operation, wherein the first transformation operation comprises reconfiguring a gate in the first quantum circuit such that a qubit used in the gate complies with the constraint on the quantum circuit design while participating in the second quantum circuit. Using the quantum computing system, the second quantum circuit is executed.

Growing community of inventors

Sleepy Hollow, NY, United States of America

Ali Javadiabhari