Phase transition of computational power in the resource states for one-way quantum computation

Abstract

We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a polynomial-time algorithm that concentrates a universal cluster state, using resources that scale optimally in the size of the original lattice. On the other hand, below the percolation threshold, we show that single qubit measurements on the faulty lattice can be efficiently simulated classically. We observe a phase transition at the threshold when the amount of entanglement in the faulty lattice directly relevant to the computational power changes exponentially.

arXiv comment12 pages, 10 figures, and a Michelangelo quote. published version: some improvements in presentation following referee comments

References in corpus (15)

• Persistent entanglement in arrays of interacting particles
• Multi-party entanglement in graph states
• Entanglement of atoms via cold controlled collisions
• Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
• Novel schemes for measurement-based quantum computation
• Entanglement Percolation in Quantum Networks
• Universal resources for measurement-based quantum computation
• Measurement-based quantum computation beyond the one-way model
• Long-range quantum entanglement in noisy cluster states
• Percolation, renormalization, and quantum computing with non-deterministic gates
• A Quantum to Classical Phase Transition in Noisy Quantum Computers
• Fundamentals of universality in one-way quantum computation
• On measurement-based quantum computation with the toric code states
• Entanglement and local information access for graph states
• The Largest Cluster in Subcritical Percolation

Cited by in corpus (38)

• Measurement-based quantum computation
• Affleck-Kennedy-Lieb-Tasaki State on a Honeycomb Lattice is a Universal Quantum Computational Resource
• Efficient classical simulation of random shallow 2D quantum circuits
• Prospects for measurement-based quantum computing with solid state spins
• Nishimori's cat: stable long-range entanglement from finite-depth unitaries and weak measurements
• Quantum computational capability of a 2D valence bond solid phase
• Limitations of quantum computing with Gaussian cluster states
• Entanglement percolation in quantum complex networks
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Resource quality of a symmetry-protected topologically ordered phase for quantum computation
• The Optical Frequency Comb as a One-Way Quantum Computer
• Quantum computational renormalization in the Haldane phase
• The 2D AKLT state on the honeycomb lattice is a universal resource for quantum computation
• Measurement-based quantum computation in a 2D phase of matter
• Generation of arbitrary all-photonic graph states from quantum emitters
• Universal measurement-based quantum computation with spin-2 Affleck-Kennedy-Lieb-Tasaki states
• Symmetry-protected topologically ordered states for universal quantum computation
• Hybrid valence-bond states for universal quantum computation
• Quantum spin systems for measurement-based quantum computation
• Probabilistic growth of large entangled states with low error accumulation
• Universal resources for approximate and stochastic measurement-based quantum computation
• Physical-depth architectural requirements for generating universal photonic cluster states
• Quantum information in the Posner model of quantum cognition
• Transitions in the computational power of thermal states for measurement-based quantum computation
• Universal quantum computing using $({\mathbb{Z}}_d{)}^3$ symmetry-protected topologically ordered states
• Quantum computational universality of spin-3/2 Affleck-Kennedy-Lieb-Tasaki states beyond the honeycomb lattice
• Completeness of classical spin models and universal quantum computation
• Fast graph operations in quantum computation
• Graph states as ground states of two-body frustration-free Hamiltonians
• An introduction to one-way quantum computing in distributed architectures
• Emergence of the XY-like phase in the deformed spin-3/2 AKLT systems
• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
• Transitions in the quantum computational power
• Quantum complexity phase transitions in monitored random circuits
• Flow to Nishimori universality in weakly monitored quantum circuits with qubit loss
• Timing constraints due to real-time graph traversal algorithms on incomplete cluster states in photonic measurement-based quantum computing
• Testing equivalence of pure quantum states and graph states under SLOCC
• Efficient classical simulation of cluster state quantum circuits with alternative inputs