Optimal calibration of gates in a quantum computing system
A method of performing a quantum computation process includes mapping logical qubits to physical qubits of a quantum processor so that quantum circuits are executable using the physical qubits of the quantum processor and a total infidelity of the plurality of quantum circuits is minimized, wherein each of the physical qubits comprise a trapped ion, and each of the plurality of quantum circuits comprises single-qubit gates and two-qubit gates within the plurality of the logical qubits, calibrating two-qubit gates within a first plurality of pairs of physical qubits, such that infidelity of the two-qubit gates within the first plurality of pairs of physical qubit is lowered, executing the plurality of quantum circuits on the quantum processor, by applying laser pulses that each cause a single-qubit gate operation and a two-qubit gate operation in each of the plurality of quantum circuits on the plurality of physical qubits, measuring population of qubit states of the physical qubits in the quantum processor, and outputting the measured population of qubit states of the physical qubits.
1. A method of performing a quantum computation process, comprising:
mapping, by a classical computer, a plurality of logical qubits to a plurality of physical qubits of a quantum processor so that a plurality of quantum circuits are executable using the physical qubits of the quantum processor, wherein
each of the physical qubits comprise a trapped ion, and
each of the plurality of quantum circuits comprises a plurality of single-qubit gates and a plurality of two-qubit gates among the plurality of the logical qubits;
adjusting, by a system controller, an amplitude and a frequency of a laser pulse to be applied to each of a first plurality of pairs of physical qubits to correct errors in two-qubit gates a among the first plurality of pairs of physical qubits;
executing the plurality of quantum circuits on the quantum processor, by applying laser pulses that each cause a single-qubit gate operation and a two-qubit gate operation in each of the plurality of quantum circuits on the plurality of physical qubits;
measuring, by the system controller, population of qubit states of the physical qubits in the quantum processor after executing the plurality of quantum circuits on the quantum processor; and
outputting, by the classical computer, the measured population of qubit states of the physical qubits as a result of the execution the plurality of quantum circuits, wherein the result of the execution the plurality of quantum circuits are configured to be displayed on a user interface, stored in a memory of the classical computer, or transferred to another computational device.
2. The method of claim 1 , further comprising:
measuring, by the system controller, population of qubit states of the first plurality of pairs of physical qubits prior to the executing of the plurality of quantum circuits on the quantum processor.
3. The method of claim 1 , further comprising:
computing, by the classical computer, a plurality of circuit graphs based on the plurality of quantum circuits, each having a plurality of vertices representing the plurality of logical qubits and a plurality of edges each representing a two-qubit gate between pairs of the plurality of logical qubits.
4. The method of claim 3 , further comprising:
computing, by the classical computer, a most compact cumulative supergraph of the plurality of circuit graphs; and
computing, by the classical computer, the first plurality of pairs of physical qubits based on the computed most compact cumulative supergraph of the plurality of circuit graphs.
5. The method of claim 3 , further comprising:
replacing, by the classical computer, one of a second plurality of circuit graphs with one of a third plurality of circuit graphs with a predetermined rate, wherein the plurality of circuit graphs comprises the second plurality of circuit graphs and the third plurality of circuit graphs;
generating, by the classical computer, a pair of circuit graphs to add to the second plurality of circuit graphs, based on a pair of the second plurality of circuit graphs;
computing, by the classical computer, a most compact cumulative supergraph of the plurality of circuit graphs; and
computing, by the classical computer, the first plurality of pairs of physical qubits based on the computed most compact cumulative supergraph comprising the second plurality of circuit graphs.
6. The method of claim 1 , wherein the number of the first plurality of pairs of physical qubits is less than a predetermined calibration budget.
7. A quantum computing system, comprising:
a quantum processor comprising a plurality of physical qubits, wherein each of the physical qubits comprises a trapped ion;
a classical computer configured to:
map a plurality of logical qubits to the plurality of physical qubits so that a plurality of quantum circuits are executable using the physical qubits, wherein each of the plurality of quantum circuits comprises a plurality of single-qubit gates and a plurality of two-qubit gates among the plurality of the logical qubits; and
a system controller configured to:
adjust an amplitude and a frequency of a laser pulse to be applied to each of a first plurality of pairs of physical qubits to correct errors in two-qubit gates among a first plurality of pairs of physical qubits;
executing the plurality of quantum circuits on the quantum processor, by applying laser pulses that each cause a single-qubit gate operation and a two-qubit gate operation in each of the plurality of quantum circuits on the plurality of physical qubits; and
measure population of qubit states of the physical qubits in the quantum processor after executing the plurality of quantum circuits on the quantum processor, wherein
the classical computer is further configured to:
output the measured population of qubit states of the physical qubits as a result of the execution the plurality of quantum circuits, wherein the result of the execution the plurality of quantum circuits are configured to be displayed on a user interface, stored in a memory of the classical computer, or transferred to another computational device.
8. The quantum computing system of claim 7 , wherein
the adjusting the amplitude and the frequency of the laser pulse comprises:
measuring, by the system controller, population of qubit states of the first plurality of pairs of physical qubits; and
adjusting, by the system controller, an amplitude and a frequency of a laser pulse to be applied to each of the first plurality of pairs of physical qubits to correct errors in the measured population of qubit states of the first plurality of pairs of physical qubits.
9. The quantum computing system of claim 7 , wherein the classical computer is further configured to:
compute a plurality of circuit graphs based on the plurality of quantum circuits, each having a plurality of vertices representing the plurality of logical qubits and a plurality of edges each representing a two-qubit gate between pairs of the plurality of logical qubits.
10. The quantum computing system of claim 9 , wherein the classical computer is further configured to:
compute a most compact cumulative supergraph of the plurality of circuit graphs; and
compute the first plurality of pairs of physical qubits based on the computed most compact cumulative supergraph of the plurality of circuit graphs.
11. The quantum computing system of claim 9 , wherein the classical computer is further configured to:
replace one of a second plurality of circuit graphs with one of a third plurality of circuit graphs with a predetermined rate, wherein the plurality of circuit graphs comprises the second plurality of circuit graphs and the third plurality of circuit graphs;
generate a pair of circuit graphs to add to the second plurality of circuit graphs, based on a pair of the second plurality of circuit graphs;
compute, by the classical computer, a most compact cumulative supergraph of the plurality of circuit graphs; and
compute the first plurality of pairs of physical qubits based on the computed most compact cumulative supergraph comprising the second plurality of circuit graphs.
12. The quantum computing system of claim 7 , wherein the number of the first plurality of pairs of physical qubits is less than a predetermined calibration budget.
13. The quantum computing system according to claim 7 , wherein
each of the physical qubits is an ion having a nuclear spin and an electron spin such that a difference between the nuclear spin and the electron spin is zero.
14. The quantum computing system according to claim 13 , wherein
each of the physical qubits is an ion having a nuclear spin ½ and the 2 S 1/2 hyperfine states.
15. A quantum computing system comprising non-volatile memory having a number of instructions stored therein which, when executed by one or more processors, causes the quantum computing system to perform operations comprising:
mapping, by a classical computer, a plurality of logical qubits to a plurality of physical qubits of a quantum processor so that a plurality of quantum circuits are executable using the physical qubits of the quantum processor, wherein
each of the physical qubits comprise a trapped ion, and
each of the plurality of quantum circuits comprises a plurality of single-qubit gates and a plurality of two-qubit gates among the plurality of the logical qubits;
adjusting, by a system controller, an amplitude and a frequency of a laser pulse to be applied to each of a first plurality of pairs of physical qubits to correct errors in two-qubit gates among the first plurality of pairs of physical qubits;
executing the plurality of quantum circuits on the quantum processor, by applying laser pulses that each cause a single-qubit gate operation and a two-qubit gate operation in each of the plurality of quantum circuits on the plurality of physical qubits;
measuring, by the system controller, population of qubit states of the physical qubits in the quantum processor after executing the plurality of quantum circuits on the quantum processor; and
outputting, by the classical computer, the measured population of qubit states of the physical qubits as a result of the execution the plurality of quantum circuits, wherein the result of the execution the plurality of quantum circuits are configured to be displayed on a user interface, stored in a memory of the classical computer, or transferred to another computational device.
16. The quantum computing system of claim 15 , wherein the operations further comprises:
measuring, by the system controller, population of qubit states of the first plurality of pairs of physical qubits prior to the executing of the plurality of quantum circuits on the quantum processor.
17. The quantum computing system of claim 15 , further comprising:
computing, by the classical computer, a plurality of circuit graphs based on the plurality of quantum circuits, each having a plurality of vertices representing the plurality of logical qubits and a plurality of edges each representing a two-qubit gate between pairs of the plurality of logical qubits.
18. The quantum computing system of claim 17 further comprising:
computing, by the classical computer, a most compact cumulative supergraph of the plurality of circuit graphs; and
computing, by the classical computer, the first plurality of pairs of physical qubits based on the computed most compact cumulative supergraph of the plurality of circuit graphs.
19. The quantum computing system of claim 15 , further comprising:
replacing, by the classical computer, one of a second plurality of circuit graphs with one of a third plurality of circuit graphs with a predetermined rate, wherein the plurality of circuit graphs comprises the second plurality of circuit graphs and the third plurality of circuit graphs;
generating, by the classical computer, a pair of circuit graphs to add to the second plurality of circuit graphs, based on a pair of the second plurality of circuit graphs;
computing, by the classical computer, a most compact cumulative supergraph of the plurality of circuit graphs; and
computing, by the classical computer, the first plurality of pairs of physical qubits based on the computed most compact cumulative supergraph comprising the second plurality of circuit graphs.
20. The quantum computing system of claim 13 , wherein the number of the first plurality of pairs of physical qubits is less than a predetermined calibration budget.