Surface code computations using Auto-CCZ quantum states
Methods and apparatus for performing surface code computations using Auto-CCZ states. In one aspect, a method for implementing a delayed choice CZ operation on a first and second data qubit using a quantum computer includes: preparing a first and second routing qubit in a magic state; interacting the first data qubit with the first routing qubit and the second data qubit with the second routing qubit using a first and second CNOT operation, where the first and second data qubits act as controls for the CNOT operations; if a received first classical bit represents an off state: applying a first and second Hadamard gate to the first and second routing qubit; measuring the first and second routing qubit using Z basis measurements to obtain a second and third classical bit; and performing classically controlled fixup operations on the first and second data qubit using the second and third classical bits.
1. A method for implementing a delayed choice CZ operation using a quantum computer, the method comprising:
applying a first Hadamard gate to a first routing qubit and applying a second Hadamard gate to a second routing qubit, wherein the first routing qubit is prepared in a magic state and interacts with a first data qubit and the second routing qubit is prepared in a magic state and interacts with a second data qubit;
measuring the first routing qubit using a Z basis measurement to obtain a second classical bit
measuring the second routing qubit using a Z basis measurement to obtain a third classical bit; and
performing classically controlled fix up operations on a first data qubit and a second data qubit using the second classical bit and the third classical bit.
2. The method of claim 1 , wherein performing classically controlled fix up operations on the first data qubit and the second data qubit using the second classical bit and the third classical bit comprises:
receiving a first classical bit that represents an off state;
applying a classically controlled swap operation to the second classical bit and third classical bit, wherein the first classical bit acts as a control for the classically controlled swap operation; and
applying a first classically controlled Z operation to the second data qubit, wherein the third classical bit acts as a control for the first classically controlled Z operation; and
applying a second classically controlled Z operation to the first data qubit, wherein the second classical bit acts as a control for the second classically controlled Z operation.
3. The method of claim 1 , further comprising preparing the first routing qubit and the second routing qubit in the magic state, comprising:
preparing the first routing qubit in a plus state;
preparing the second routing qubit in a plus state; and
performing a CZ operation on the first routing qubit and the second routing qubit.
4. The method of claim 2 , wherein the first classical bit comprises an output of a classical computation that determines whether or not a classical controlled Z operation is to be performed on the first data qubit and second data qubit.
5. A quantum computation system comprising:
a plurality of data qubits;
a plurality of routing qubits; and
a plurality of control devices configured to operate the plurality of data qubits and the plurality of routing qubits;
wherein the quantum computation system is configured to perform operations comprising:
applying a first Hadamard gate to a first routing qubit and applying a second Hadamard gate to a second routing qubit, wherein the first routing qubit is prepared in a magic state and interacts with a first data qubit and the second routing qubit is prepared in a magic state and interacts with a second data qubit;
measuring the first routing qubit using a Z basis measurement to obtain a second classical bit
measuring the second routing qubit using a Z basis measurement to obtain a third classical bit; and
performing classically controlled fix up operations on the first data qubit and second data qubit using the second classical bit and the third classical bit.
6. The quantum computation system of claim 5 , wherein performing classically controlled fix up operations on the first data qubit and the second data qubit using the second classical bit and the third classical bit comprises:
receiving a first classical bit that represents an off state;
applying a classically controlled swap operation to the second classical bit and third classical bit, wherein the first classical bit acts as a control for the classically controlled swap operation; and
applying a first classically controlled Z operation to the second data qubit, wherein the third classical bit acts as a control for the first classically controlled Z operation; and applying a second classically controlled Z operation to the first data qubit, wherein the second classical bit acts as a control for the second classically controlled Z operation.
7. The quantum computation system of claim 5 , wherein the operations further comprise preparing the first routing qubit and the second routing qubit in the magic state, comprising:
preparing the first routing qubit in a plus state;
preparing the second routing qubit in a plus state; and
performing a CZ operation on the first routing qubit and the second routing qubit.
8. The quantum computation system of claim 6 , wherein the first classical bit comprises an output of a classical computation that determines whether or not a classical controlled Z operation is to be performed on the first data qubit and second data qubit.
9. A method for implementing an auto corrected CCZ operation on a first, second and third data qubit using a quantum computer, the method comprising:
measuring a fourth routing qubit to obtain a fourth classical bit that represents an on state, wherein the fourth routing qubit is prepared in a magic state and interacts with the second data qubit;
measuring a seventh routing qubit to obtain a seventh classical bit that represents an on state, wherein the seventh routing qubit is prepared in a magic state and interacts with the third data qubit;
applying a first Hadamard gate to a fifth routing qubit prepared in a magic state and applying a second Hadamard gate to a sixth routing qubit prepared in a magic state;
measuring the fifth routing qubit using a Z basis measurement to obtain a fifth classical bit and measuring the sixth routing qubit using a Z basis measurement to obtain a sixth classical bit;
applying a third Hadamard gate to an eighth routing qubit prepared in a magic state and applying a fourth Hadamard gate to a ninth routing qubit prepared in a magic state;
measuring the eighth routing qubit using a Z basis measurement to obtain an eighth classical bit and measuring the ninth routing qubit using a Z basis measurement to obtain a ninth classical bit;
applying a fifth Hadamard gate to a second routing qubit prepared in a magic state and applying a sixth Hadamard gate to a third routing qubit prepared in a magic state;
measuring the second routing qubit using a Z basis measurement to obtain a second classical bit and measuring the third routing qubit using a Z basis measurement to obtain a third classical bit; and
performing classically controlled fix up operations on the first, second and third data qubits using each of the classical bits.
10. The method of claim 9 , further comprising preparing each of the routing qubits in a magic state, comprising:
preparing each of the routing qubits in a plus state;
performing a CCZ operation on the routing qubits;
performing CZ operations on pairs of neighboring routing qubits.
11. The method of claim 9 , wherein performing classically controlled fix up operations on the first, second and third data qubits comprises:
measuring a first routing qubit to obtain a first classical bit that represents an on state, wherein the first routing qubit is prepared in a magic state and interacts with the first data qubit;
applying a first classically controlled swap operation to the second classical bit and third classical bit, wherein the seventh classical bit acts as a control for the first classically controlled swap operation;
applying a second classically controlled swap operation to the fifth classical bit and sixth classical bit, wherein the first classical bit acts as a control for the second classically controlled swap operation;
applying a third classically controlled swap operation to the eighth classical bit and ninth classical bit, wherein the fourth classical bit acts as a control for the third classically controlled swap operation;
applying multiple classically controlled Z operations to the first, second, and third data qubits, wherein each classically controlled Z operation uses one of the second, third, fifth, sixth, eighth or ninth classical bits as a control for the classically controlled Z operation;
applying multiple classically controlled-controlled Z operations to the first, second and third data qubits, wherein each classically controlled-controlled Z operation uses two of the first, fourth and seventh classical bits as controls for the classically controlled-controlled Z operation.
12. The method of claim 11 , wherein applying multiple classically controlled Z operations to the first, second, and third data qubits, wherein each classically controlled Z operation uses one of the second, third, fifth, sixth, eighth or ninth classical bits as a control for the classically controlled Z operation, comprises:
applying a first classically controlled Z operation to the third data qubit, wherein the second classical bit acts as a control for the first classically controlled Z operation;
applying a second classically controlled Z operation to the second data qubit, wherein the third classical bit acts as a control for the second classically controlled Z operation;
applying a third classically controlled Z operation to the third data qubit, wherein the fifth classical bit acts as the control for the third classically controlled Z operation;
applying a fourth classically controlled Z operation to the first data qubit, wherein the sixth classical bit acts as the control for the fourth classically controlled Z operation;
applying a fifth classically controlled Z operation to the second data qubit, wherein the eighth classical bit acts as the control for the fifth classically controlled Z operation; and
applying a sixth classically controlled Z operation to the first data qubit, wherein the ninth classical bit acts as the control for the sixth classically controlled Z operation.
13. The method of claim 11 , wherein applying multiple classically controlled-controlled Z operations to the first, second and third data qubits, wherein each classically controlled-controlled Z operation uses two of the first, fourth and seventh classical bits as controls for the classically controlled-controlled Z operation, comprises:
applying a first classically controlled-controlled Z operation to the first data qubit, wherein the first classical bit and fourth classical bit act as controls for the first classically controlled-controlled Z operation;
applying a second classically controlled-controlled Z operation to the second data qubit, wherein the fourth classical bit and seventh classical bit act as controls for the second classically controlled-controlled Z operation; and
applying a third classically controlled-controlled Z operation to the third data qubit, wherein the first classical bit and seventh classical bit act as controls for the third classically controlled-controlled Z operation.
14. A quantum computation system comprising:
a plurality of data qubits;
a plurality of routing qubits; and
a plurality of control devices configured to operate the plurality of data qubits and the plurality of routing qubits;
wherein the quantum computation system is configured to perform operations comprising:
measuring a fourth routing qubit to obtain a fourth classical bit that represents an on state, wherein the fourth routing qubit is prepared in a magic state and interacts with a second data qubit;
measuring a seventh routing qubit to obtain a seventh classical bit that represents an on state, wherein the seventh routing qubit is prepared in a magic state and interacts with a third data qubit;
applying a first Hadamard gate to a fifth routing qubit prepared in a magic state and applying a second Hadamard gate to a sixth routing qubit prepared in a magic state;
measuring the fifth routing qubit using a Z basis measurement to obtain a fifth classical bit and measuring the sixth routing qubit using a Z basis measurement to obtain a sixth classical bit;
applying a third Hadamard gate to an eighth routing qubit prepared in a magic state and applying a fourth Hadamard gate to a ninth routing qubit prepared in a magic state;
measuring the eighth routing qubit using a Z basis measurement to obtain an eighth classical bit and measuring the ninth routing qubit using a Z basis measurement to obtain a ninth classical bit;
applying a fifth Hadamard gate to a second routing qubit prepared in a magic state and applying a sixth Hadamard gate to a third routing qubit prepared in a magic state;
measuring the second routing qubit using a Z basis measurement to obtain a second classical bit and measuring the third routing qubit using a Z basis measurement to obtain a third classical bit; and
performing classically controlled fix up operations on the second and third data qubits using each of the classical bits.
15. The quantum computation system of claim 14 , wherein the operations further comprise preparing each of the routing qubits in a magic state, comprising:
preparing each of the routing qubits in a plus state;
performing a CCZ operation on the routing qubits; and
performing CZ operations on pairs of neighboring routing qubits.
16. The quantum computation system of claim 14 , wherein performing classically controlled fix up operations on the second and third data qubits comprises:
measuring a first routing qubit to obtain a first classical bit that represents an on state, wherein the first routing qubit is prepared in a magic state and interacts with a first data qubit;
applying a first classically controlled swap operation to the second classical bit and third classical bit, wherein the seventh classical bit acts as a control for the first classically controlled swap operation;
applying a second classically controlled swap operation to the fifth classical bit and sixth classical bit, wherein the first classical bit acts as a control for the second classically controlled swap operation;
applying a third classically controlled swap operation to the eighth classical bit and ninth classical bit, wherein the fourth classical bit acts as a control for the third classically controlled swap operation;
applying multiple classically controlled Z operations to the first, second, and third data qubits, wherein each classically controlled Z operation uses one of the second, third, fifth, sixth, eighth or ninth classical bits as a control for the classically controlled Z operation;
applying multiple classically controlled-controlled Z operations to the first, second and third data qubits, wherein each classically controlled-controlled Z operation uses two of the first, fourth and seventh classical bits as controls for the classically controlled-controlled Z operation.
17. The quantum computation system of claim 16 , wherein applying multiple classically controlled Z operations to the first, second, and third data qubits, wherein each classically controlled Z operation uses one of the second, third, fifth, sixth, eighth or ninth classical bits as a control for the classically controlled Z operation, comprises:
applying a first classically controlled Z operation to the third data qubit, wherein the second classical bit acts as a control for the first classically controlled Z operation;
applying a second classically controlled Z operation to the second data qubit, wherein the third classical bit acts as a control for the second classically controlled Z operation;
applying a third classically controlled Z operation to the third data qubit, wherein the fifth classical bit acts as the control for the third classically controlled Z operation;
applying a fourth classically controlled Z operation to the first data qubit, wherein the sixth classical bit acts as the control for the fourth classically controlled Z operation;
applying a fifth classically controlled Z operation to the second data qubit, wherein the eighth classical bit acts as the control for the fifth classically controlled Z operation; and
applying a sixth classically controlled Z operation to the first data qubit, wherein the ninth classical bit acts as the control for the sixth classically controlled Z operation.
18. The quantum computation system of claim 16 , wherein applying multiple classically controlled-controlled Z operations to the first, second and third data qubits, wherein each classically controlled-controlled Z operation uses two of the first, fourth and seventh classical bits as controls for the classically controlled-controlled Z operation, comprises:
applying a first classically controlled-controlled Z operation to the first data qubit, wherein the first classical bit and fourth classical bit act as controls for the first classically controlled-controlled Z operation;
applying a second classically controlled-controlled Z operation to the second data qubit, wherein the fourth classical bit and seventh classical bit act as controls for the second classically controlled-controlled Z operation; and
applying a third classically controlled-controlled Z operation to the third data qubit, wherein the first classical bit and seventh classical bit act as controls for the third classically controlled-controlled Z operation.