Abstract
A lattice surgery protocol is introduced to optimize quantum computing, helping to eliminate extra circuit components and gate scheduling complexities, or reduce runtimes and the total space-time costs.
Highlights
Fault-tolerant quantum computing architectures enable the protection of logical qubits from errors by encoding them in error-correcting codes, while simultaneously allowing for gates to be performed on such qubits
II A, we briefly review the principles of Paulibased computation (PBC) used throughout this work
In the model of PBC, we have a reserve of magic states and we drive the computation by performing a sequence of multiqubit Pauli measurements {P1, P2, . . . , Pμ}, where later Pauli measurements depend on measurement outcomes of earlier measurements
Summary
Fault-tolerant quantum computing architectures enable the protection of logical qubits from errors by encoding them in error-correcting codes, while simultaneously allowing for gates to be performed on such qubits. Lattice surgery [8] has replaced the braiding approach due to its ability to retain locality constraints and high thresholds (features that are required by many hardware architectures), while offering a much lower resource cost [9–12] These approaches all perform non-Clifford gates by teleportation [13,14] of magic states prepared by some distillation procedure [15–21]. We show that by using thin rectangular strips of surface codes for settings where a large noise bias is present, the overhead costs due to routing in our proposed architecture adds a multiplicative factor of 1.5 increase to the total resource costs for performing lattice surgery. This can be compared with the factor-of-2 cost of Litinski’s fast data-access structures [12].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
