Universal resources for measurement-based quantum computation
arXiv:quant-ph/0604010 · doi:10.1103/PhysRevLett.97.150504
Abstract
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess universality of graph states, by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal non-graph state.
4 pages, 1 figure; final version
References in corpus (5)
Cited by in corpus (43)
- Entanglement purification and quantum error correction
- Novel schemes for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Computational power of correlations
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Universal quantum computation with little entanglement
- Classical simulation versus universality in measurement based quantum computation
- Fundamentals of universality in one-way quantum computation
- A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
- On measurement-based quantum computation with the toric code states
- Completeness of the classical 2D Ising model and universal quantum computation
- The Optical Frequency Comb as a One-Way Quantum Computer
- Entanglement and local information access for graph states
- Quantum computation by local measurement
- Non-adaptive Measurement-based Quantum Computation and Multi-party Bell Inequalities
- Quantum entanglement analysis based on abstract interpretation
- Phase transition of computational power in the resource states for one-way quantum computation
- Cluster-type entangled coherent states
- Graph states as ground states of many-body spin-1/2 Hamiltonians
- Optimal preparation of graph states
- Thermal States as Universal Resources for Quantum Computation with Always-on Interactions
- Quantum computation in correlation space and extremal entanglement
- Generalized Ardehali-Bell inequalities for graph states
- Growth of graph states in quantum networks
- Modeling Pauli measurements on graph states with nearest-neighbor classical communication
- A variational method based on weighted graph states
- Compact Toffoli gate using weighted graph states
- Spin lattices with two-body Hamiltonians for which the ground state encodes a cluster state
- Acausal measurement-based quantum computing
- Direct evaluation of pure graph state entanglement
- Measurement-based quantum computation and undecidable logic
- How much of one-way computation is just thermodynamics?
- Bipartite Entanglement in Continuous-Variable Cluster States
- Characterizing measurement-based quantum gates in quantum many-body systems using correlation functions
- Epsilon-measures of entanglement
- Error-correcting one-way quantum computation with global entangling gates
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications
- Symmetry constraints on temporal order in measurement-based quantum computation
- Percolation in quantum computation and communication
- Quantum algorithm for Bose-Einstein condensate quantum fluid dynamics
- Discrimination strategies for inequivalent classes of multipartite entangled states
- Stabilizer states and local realism
- Perfect Cluster States from Imperfect Global Entanglement