Fault-tolerant quantum cat state preparation
A quantum computing system is adapted to prepare a cat state in a quantum circuit with fault tolerance t and circuit depth less than or equal to 4+4t by performing a series of operations that includes: performing a sequence of joint parity measurements on individual pairs of neighboring qubits in a series of qubits entangled to form an initial cat state; repeating the sequence of measurements over at least t-rounds; and disentangling a first set of alternating qubits from the initial cat state, the prepared cat state being formed by a remaining second set of alternating qubits, the second set of alternating qubits being interlaced with the first set of alternating qubits along a line of one-dimensional connectivity, the series of operations being sufficient to guarantee that a prepared cat state is has less than or equal to t number of faults.
1. A method comprising:
performing a series of operations to prepare a cat state in a quantum circuit with fault tolerance t and circuit depth less than or equal to 4+4t, series of operations including at least:
performing a sequence of joint parity measurements on individual pairs of neighboring qubits in a series of qubits entangled to form an initial cat state;
repeating the sequence of measurements over at least t-rounds; and
disentangling a first set of alternating qubits from the initial cat state to form the prepared cat state with a remaining second set of alternating qubits, the second set of alternating qubits being interlaced with the first set of alternating qubits along a line of one-dimensional connectivity, the prepared cat state being guaranteed with a predefined degree of certainty to include less than or equal to t number of faults.
2. The method of claim 1 , further comprising:
performing additional operations to extract a measurement of two or more data qubits using the prepared cat state, the additional operations including:
entangling the two or more data qubits with the prepared cat state; and
extracting a measurement result of the two or more data qubits from the prepared cat state.
3. The method of claim 1 , further comprising:
responsive to determining that any one of the joint parity measurements yields a non-trivial outcome, rejecting the cat state and preparing a new cat state; and
proceeding to the next round of the at least t-rounds of measurement responsive to determining that none of the joint parity measurements yields a non-trivial outcome.
4. The method of claim 1 , wherein repeating the sequence of measurements over at least t-rounds further comprises:
performing 2*t-rounds of the sequence of measurements, the 2*t-rounds being sufficient to guarantee with the predefined degree of certainty fault tolerance up to t number of faults without rejecting the cat state under any circumstances.
5. The method of claim 4 , further comprising:
for each measurement of the 2*t rounds, computing and storing an N-qubit Pauli operator usable to alter a stored quantum state of one or more of the qubits to transform the measurement outcome from non-trivial to trivial.
6. The method of claim 5 , further comprising:
following the 2*t rounds, correcting a stored quantum state of each of the qubits in series based on the computed and stored N-qubit Pauli operators.
7. The method of claim 1 , further comprising:
preparing the prepared cat state by performing a sequence of operations to entangle the series of qubits, the sequence of operations comprising:
performing an x-basis measurement of each one of the qubits in the series;
for each one of the x-basis measurements with an outcome that is non-trivial, implementing a measurement update operation to flip the outcome;
performing a z-basis joint parity measurement on each individual pair of neighboring qubits in the series of qubits; and
for each one of the z-basis joint parity measurements with an outcome that is non-trivial, implementing a measurement update operation to flip the outcome.
8. The method of claim 1 , wherein the depth of the quantum circuit is independent of qubit connectivity, size of the prepared cat sate, and distance between the qubits in the series.
9. A quantum device comprising:
a cat state preparation circuit with fault tolerance t and circuit depth less than or equal to 4+4t, the cat state preparation circuit configured to:
perform a sequence of joint parity measurements on individual pairs of neighboring qubits in a series of qubits entangled to form an initial cat state;
repeat the sequence of measurements over at least t-rounds; and
disentangle a first set of alternating qubits from the initial cat state to form a prepared cat state that is guaranteed with a predefined degree of certainty to include less than or equal to t number of faults, the prepared cat state being formed by a remaining second set of alternating qubits, the second set of alternating qubits being interlaced with the first set of alternating qubits along a line of one-dimensional connectivity.
10. The quantum device of claim 9 , wherein the cat state preparation circuit is further configured to:
perform operations to extract a measurement of two or more data qubits using the prepared cat state, the operations including:
entangling the two or more data qubits with the prepared cat state; and
extracting a measurement result of the two or more data qubits from the prepared cat state.
11. The quantum device of claim 9 , wherein the cat state preparation circuit is further configured to:
responsive to determining that any one of the joint parity measurements yields a non-trivial outcome, reject the cat state and prepare a new cat state; and
proceed to the next round of the at least t-rounds of measurement responsive to determining that none of the joint parity measurements yields a non-trivial outcome.
12. The quantum device of claim 9 , wherein the cat state preparation circuit repeats the sequence of measurements over at the least t-rounds of measurement by:
performing 2*t-rounds of the sequence of measurements, the 2*t-rounds being sufficient to guarantee with the predefined degree of certainty fault tolerance up to t number of faults without rejecting the cat state under any circumstances.
13. The quantum device of claim 12 , wherein the cat state preparation circuit is further configured to:
compute and store an N-qubit Pauli operator for each measurement of the 2*t rounds, the N-qubit Pauli operator being usable to alter a stored quantum state of one or more of the qubits to transform the outcome for the measurement from non-trivial to trivial.
14. The quantum device of claim 13 , wherein the cat state preparation circuit is further configured to:
correct a stored quantum state of each of the qubits in series based on the computed and stored N-qubit Pauli operators.
15. The quantum device of claim 9 , wherein the cat state preparation circuit is further configured to:
prepare the prepared cat state by performing a sequence of operations to entangle the series of qubits, the sequence of operations comprising:
perform an x-basis measurement of each one of the qubits in the series;
for each one of the x-basis measurements with an outcome that is non-trivial, implementing a measurement update operation to flip the outcome;
perform a z-basis joint parity measurement on each individual pair of neighboring qubits in the series of qubits; and
for each one of the z-basis joint parity measurements with an outcome that is non-trivial, implement a measurement update operation to flip the outcome.
16. The quantum device of claim 9 , wherein the depth of the cat state preparation circuit is independent of qubit connectivity, size of the prepared cat sate, and distance between the qubits in the series.
17. One or more tangible computer readable storage media storing processor-executable instructions for executing a computer process to prepare a cat state in a quantum circuit with fault tolerance t and circuit depth less than or equal to 4+4t, the computer process comprising:
performing a sequence of joint parity measurements on individual pairs of neighboring qubits in a series of qubits entangled to form an initial cat state;
repeating the sequence of measurements over at least t-rounds; and
disentangling a first set of alternating qubits from the initial cat state to form the prepared cat state with a remaining second set of alternating qubits, the second set of alternating qubits being interlaced with the first set of alternating qubits along a line of one-dimensional connectivity, the prepared cat state being guaranteed with a predefined degree of certainty to include less than or equal to t number of faults.
18. The one or more computer-readable storage media of claim 17 , wherein the computer process further comprises:
responsive to determining that any one of the joint parity measurements yields a non-trivial outcome, rejecting the cat state and preparing a new cat state; and
proceeding to the next round of the at least t-rounds of measurement responsive to determining that none of the joint parity measurements yields a non-trivial outcome.
19. The one or more computer-readable storage media of claim 17 , wherein the computer process further comprises:
performing 2*t-rounds of the sequence of measurements, the 2*t-rounds being sufficient to guarantee with the predefined degree of certainty fault tolerance up to t number of faults without rejecting the cat state under any circumstances.
20. The one or more computer-readable storage media of claim 19 , wherein the computer process further comprises:
for each measurement of the 2*t rounds, computing and storing an N-qubit Pauli operator usable to alter a stored quantum state of one or more of the qubits to transform an outcome of the measurement from non-trivial to trivial.