Surface code quantum computing by lattice surgery

DOI10.1088/1367-2630/14/12/123011zbMath1448.81240arXiv1111.4022OpenAlexW3103149928WikidataQ59567528 ScholiaQ59567528MaRDI QIDQ5137804

Simon J. Devitt, Rodney Van Meter, Austin G. Fowler, Clare Horsman

Publication date: 2 December 2020

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.4022

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coding (general) (81P70) Quantum gates (81P65)

Related Items (15)

Bulk-to-boundary anyon fusion from microscopic models ⋮ Algebraic aspects of boundaries in the Kitaev quantum double model ⋮ Lattice surgery translation for quantum computation ⋮ Logical qubit behavior model and fast simulation for surface code ⋮ Estimating quantum speedups for lattice sieves ⋮ Convolutional neural network based decoders for surface codes ⋮ Unnamed Item ⋮ Multi-qubit parity measurement in circuit quantum electrodynamics ⋮ Unfolding the color code ⋮ A magic state’s fidelity can be superior to the operations that created it ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ Lattice surgery-based surface code architecture using remote logical CNOT operation ⋮ Target-generating quantum error correction coding scheme based on generative confrontation network ⋮ Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms ⋮ Quantum convolutional codes concatenated with the GKP code for correcting continuous errors

Uses Software

• Blossom V

Cites Work

• Unnamed Item
• Unnamed Item
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Fault-tolerant quantum computation by anyons
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Topological Computation without Braiding
• Quantum measurements and gates by code deformation
• Reliable quantum computers
• Topological quantum memory
• Clifford gates by code deformation
• Paths, Trees, and Flowers
• Why should anyone care about computing with anyons?
• Maximum matching and a polyhedron with 0,1-vertices
• Projective plane and planar quantum codes

This page was built for publication: Surface code quantum computing by lattice surgery