On measurement-based quantum computation with the toric code states

Abstract

We study measurement-based quantum computation (MQC) using as quantum resource the planar code state on a two-dimensional square lattice (planar analogue of the toric code). It is shown that MQC with the planar code state can be efficiently simulated on a classical computer if at each step of MQC the sets of measured and unmeasured qubits correspond to connected subsets of the lattice.

9 pages, 5 figures

References in corpus (17)

• Fault-tolerant quantum computation by anyons
• Efficient simulation of one-dimensional quantum many-body systems
• Topological quantum memory
• Quantum Algorithms Revisited
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Classical simulation of quantum many-body systems with a tree tensor network
• The characterization of Gaussian operations and Distillation of Gaussian States
• Quantum error-correcting codes associated with graphs
• Classical simulation of noninteracting-fermion quantum circuits
• Novel schemes for measurement-based quantum computation
• Ground state entanglement and geometric entropy in the Kitaev's model
• Universal resources for measurement-based quantum computation
• Three-spin interactions in optical lattices and criticality in cluster Hamiltonians
• Long-range quantum entanglement in noisy cluster states
• Unified derivations of measurement-based schemes for quantum computation
• Classical simulation versus universality in measurement based quantum computation
• Classical spin models and the quantum stabilizer formalism

Cited by in corpus (52)

• Measurement-based quantum computation
• Simulating quantum computation by contracting tensor networks
• Measurement-Only Topological Quantum Computation
• Measurement-based quantum computation beyond the one-way model
• Experimental demonstration of a graph state quantum error-correction code
• Architectures for quantum simulation showing a quantum speedup
• Completeness of the classical 2D Ising model and universal quantum computation
• Quantum computation by local measurement
• Quantum Commuting Circuits and Complexity of Ising Partition Functions
• Phase transition of computational power in the resource states for one-way quantum computation
• Statistical Mechanical Models and Topological Color Codes
• Quantum algorithms for spin models and simulable gate sets for quantum computation
• Thermalization, Error-Correction, and Memory Lifetime for Ising Anyon Systems
• Quantum algorithms for classical lattice models
• Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
• Quantum spin systems for measurement-based quantum computation
• How to simulate quantum measurement without computing marginals
• Topological Color Codes and Two-Body Quantum Lattice Hamiltonians
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Transitions in the computational power of thermal states for measurement-based quantum computation
• Completeness of classical spin models and universal quantum computation
• Efficient Magic State Distillation by Zero-Level Distillation
• Measurement-induced phase transitions in the toric code
• Solving search problems by strongly simulating quantum circuits
• A quantum algorithm for additive approximation of Ising partition functions
• Acausal measurement-based quantum computing
• Classical Ising model test for quantum circuits
• Measurement-based quantum computation and undecidable logic
• Dual correspondence between classical spin models and quantum CSS states
• An algorithmic proof for the completeness of two-dimensional Ising model
• Completeness of classical ${\varphi }^4$ theory on 2D lattices
• Realization of Topological Quantum Computation with surface codes
• Quantum computational tensor network on string-net condensate
• Phase transition in a noisy Kitaev toric code model
• Topological line in frustrated Toric code models
• A quantum information approach to statistical mechanics
• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• The Gauge Theory of Measurement-Based Quantum Computation
• A BQP-complete problem related to the Ising model partition function via a new connection between quantum circuits and graphs
• Quantum simulation of classical thermal states
• Quantum computation by teleportation and symmetry
• Classification of measurement-based quantum wire in stabilizer PEPS
• Percolation in quantum computation and communication
• Symmetries of Codeword Stabilized Quantum Codes
• Dimer states of Rydberg atoms on the Kagome lattice as resources for universal measurement-based quantum computation
• Noisy Toric code and random bond Ising model: The error threshold in a dual picture
• Ising models and topological codes: classical algorithms and quantum simulation
• Counter-intuitive yet efficient regimes for measurement based quantum computation on symmetry protected spin chains
• Quantum Entanglement Phase Transitions and Computational Complexity: Insights from Ising Models
• Classical simulation of measurement-based quantum computation on higher-genus surface-code states
• A renormalization group decoding algorithm for topological quantum codes
• Generation of topologically useful entangled states