Universal resources for approximate and stochastic measurement-based quantum computation
arXiv:0904.3641 · doi:10.1103/PhysRevA.81.042315
Abstract
We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation, in the sense that any quantum state can be generated from a given resource by means of single-qubit (local) operations assisted by classical communication. More precisely, we consider the approximate and stochastic generation of states, resulting e.g. from a restriction to finite measurement settings or from possible imperfections in the resources or local operations. We show that entanglement-based criteria for universality obtained for the exact, deterministic case can be lifted to the much more general approximate, stochastic case, moving from the idealized situation considered in previous works, to the practically relevant context of non-perfect state preparation. We find that any entanglement measure fulfilling some basic requirements needs to reach its maximum value on some element of an approximate, stochastic universal family of resource states, as the resource size grows. This allows us to rule out various families of states as being approximate, stochastic universal. We provide examples of resources that are efficient approximate universal, but not exact deterministic universal. We also study the robustness of universal resources for measurement-based quantum computation under realistic assumptions about the (imperfect) generation and manipulation of entangled states, giving an explicit expression for the impact that errors made in the preparation of the resource have on the possibility to use it for universal approximate and stochastic state preparation. Finally, we discuss the relation between our entanglement-based criteria and recent results regarding the uselessness of states with a high degree of geometric entanglement as universal resources.
arXiv comment17 pages; abstract shortened with respect to the published version to respect the arXiv limit of 1,920 characters
References in corpus (28)
- Mixed State Entanglement and Quantum Error Correction
- Elementary gates for quantum computation
- Three qubits can be entangled in two inequivalent ways
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantifying Entanglement
- Persistent entanglement in arrays of interacting particles
- Quantum Teleportation is a Universal Computational Primitive
- Measurement-based quantum computation with cluster states
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Distance measures to compare real and ideal quantum processes
- Most quantum states are too entangled to be useful as computational resources
- Novel schemes for measurement-based quantum computation
- The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
- Monotones and invariants for multi-particle quantum states
- Universal resources for measurement-based quantum computation
- Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state
- Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
- Fault-tolerant quantum computation with cluster states
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Are random pure states useful for quantum computation?
- Classical simulation versus universality in measurement based quantum computation
- Fundamentals of universality in one-way quantum computation
- Entanglement and local information access for graph states
- Adiabatic quantum computation and quantum phase transitions
- Simple proof of fault tolerance in the graph-state model
- Phase transition of computational power in the resource states for one-way quantum computation
- Transitions in the computational power of thermal states for measurement-based quantum computation
- Epsilon-measures of entanglement
Cited by in corpus (20)
- The maximally entangled symmetric state in terms of the geometric measure
- Limitations of quantum computing with Gaussian cluster states
- Quantum computational renormalization in the Haldane phase
- Non-adaptive Measurement-based Quantum Computation and Multi-party Bell Inequalities
- Additivity and non-additivity of multipartite entanglement measures
- Entanglement and Discord of superposition of Greenberger-Horne-Zeilinger states
- Classification of Entanglement in Symmetric States
- A comparison of old and new definitions of the geometric measure of entanglement
- Connections of geometric measure of entanglement of pure symmetric states to quantum state estimation
- Epsilon-smooth measure of coherence
- An algorithmic proof for the completeness of two-dimensional Ising model
- Geometric Entanglement of Symmetric States and the Majorana Representation
- Completeness of classical theory on 2D lattices
- Compact quantum circuits from one-way quantum computation
- The Hadamard gate cannot be replaced by a resource state in universal quantum computation
- General scheme for preparation of different topological states on the cluster states
- Maximally entangled gapped ground state of lattice fermions
- Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication
- Scheme for measurement-based quantum computation on projected entangled-pair states
- Efficient classical simulation of cluster state quantum circuits with alternative inputs