Single-shot error mitigation for Clifford circuits
Systems and techniques that facilitate improved single-shot error mitigation for Clifford circuits are provided. For a Clifford circuit, various embodiments described herein can facilitate two-sided or one-sided Pauli checks. In various aspects, left-side Pauli operators of two-sided Pauli checks can be selected randomly without replacement, and right-side Pauli operators of two-sided Pauli checks can be identified via commutation identities respectively relating the Clifford circuit to the left-side Pauli operators. In various instances, Pauli operators of one-sided Pauli checks can be selected via commutation identities respectively relating the Clifford circuit to Z-type Paulis selected randomly without replacement. For either two-sided or one-sided Pauli checks, various embodiments described herein can involve implementation of interleaved SWAP gates, which can allow such two-sided or one-sided Pauli checks to be performed on linear nearest neighbor coupling topologies.
1. A system, comprising:
a processor that executes computer-executable instructions stored in a non-transitory computer-readable memory, which causes a processor to facilitate operations comprising:
performing a Clifford circuit on a set of data qubits; and
detecting an error in performance of the Clifford circuit by measuring a set of check qubits using nested two-sided Pauli checks that sandwich the Clifford circuit, wherein left-side Pauli operators of the nested two-sided Pauli checks are selected randomly without replacement, wherein right-side Pauli operators of the nested two-sided Pauli checks are selected based on a commutation circuit identity relating respective ones of the left-side Pauli operators to the Clifford circuit.
2. The system of claim 1 , wherein the operations further comprise:
post-selecting on a zero state for each of the set of check qubits.
3. The system of claim 1 , wherein the set of data qubits and the set of check qubits are arranged in a linear nearest neighbor coupling topology, and wherein the nested two-sided Pauli checks contain interleaved SWAP gates.
4. The system of claim 3 , wherein each controlled Pauli gate of the nested two-sided Pauli checks is followed by a respective one of the set of interleaved SWAP gates.
5. A computer-implemented method, comprising:
performing, by a device operatively coupled to a processor, a Clifford circuit on a set of data qubits; and
detecting, by the device, an error in performance of the Clifford circuit by measuring a set of check qubits using nested two-sided Pauli checks that sandwich the Clifford circuit, wherein left-side Pauli operators of the nested two-sided Pauli checks are selected randomly without replacement, wherein right-side Pauli operators of the nested two-sided Pauli checks are selected based on a commutation circuit identity relating respective ones of the left-side Pauli operators to the Clifford circuit.
6. The computer-implemented method of claim 5 , further comprising:
post-selecting, by the device, on a zero state for each of the set of check qubits.
7. The computer-implemented method of claim 5 , wherein the set of data qubits and the set of check qubits are arranged in a linear nearest neighbor coupling topology, and wherein the nested two-sided Pauli checks contain interleaved SWAP gates.
8. The computer-implemented method of claim 7 , wherein each controlled Pauli gate of the nested two-sided Pauli checks is followed by a respective one of the set of interleaved SWAP gates.
9. A computer program product for facilitating improved single-shot error mitigation for Clifford circuits, the computer program product comprising a non-transitory computer-readable memory having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
perform a Clifford circuit on a set of data qubits; and
detect an error in performance of the Clifford circuit by measuring a set of check qubits using nested two-sided Pauli checks that sandwich the Clifford circuit, wherein left-side Pauli operators of the nested two-sided Pauli checks are selected randomly without replacement, wherein right-side Pauli operators of the nested two-sided Pauli checks are selected based on a commutation circuit identity relating respective ones of the left-side Pauli operators to the Clifford circuit.
10. The computer program product of claim 9 , wherein the processor post-selects on a zero state for each of the set of check qubits.
11. The computer program product of claim 9 , wherein the set of data qubits and the set of check qubits are arranged in a linear nearest neighbor coupling topology, and wherein the nested two-sided Pauli checks contain interleaved SWAP gates.
12. The computer program product of claim 11 , wherein each controlled Pauli gate of the nested two-sided Pauli checks is followed by a respective one of the set of interleaved SWAP gates.
13. A system, comprising:
a processor that executes computer-executable instructions stored in a non-transitory computer-readable memory, which causes the processor to facilitate operations comprising:
performing a Clifford circuit on a set of data qubits; and
detecting an error in performance of the Clifford circuit by measuring a set of check qubits using nested one-sided Pauli checks that are prior to the Clifford circuit, wherein the nested one-sided Pauli checks are selected based on a commutation circuit identity relating the Clifford circuit to Z-type Pauli operators that are selected randomly without replacement.
14. The system of claim 13 , wherein the operations further comprise:
measuring, after execution of the Clifford circuit and without intervening operators, the set of data qubits, and wherein the detecting the error is based on classically processing measured states of the set of check qubits with measured states of the set of data qubits.
15. The system of claim 14 , wherein the detection component performs such classical processing via one or more Exclusive-OR Boolean operations.
16. The system of claim 13 , wherein the set of data qubits and the set of check qubits are arranged in a linear nearest neighbor coupling topology, and wherein the nested one-sided Pauli checks contain interleaved SWAP gates.
17. A computer-implemented method, comprising:
performing, by a device operatively coupled to a processor, a Clifford circuit on a set of data qubits; and
detecting, by the device, an error in performance of the Clifford circuit by measuring a set of check qubits using nested one-sided Pauli checks that are prior to the Clifford circuit, wherein the nested one-sided Pauli checks are selected based on a commutation circuit identity relating the Clifford circuit to Z-type Pauli operators that are selected randomly without replacement.
18. The computer-implemented method of claim 17 , wherein the device measures, after execution of the Clifford circuit and without intervening operators, the set of data qubits, and wherein the device detects the error based on classically processing measured states of the set of check qubits with measured states of the set of data qubits.
19. The computer-implemented method of claim 18 , wherein the device performs such classical processing via one or more Exclusive-OR Boolean operations.
20. The computer-implemented method of claim 17 , wherein the set of data qubits and the set of check qubits are arranged in a linear nearest neighbor coupling topology, and wherein the nested one-sided Pauli checks contain interleaved SWAP gates.