Towards Minimal Resources of Measurement-based Quantum Computation
arXiv:0704.0202 · doi:10.1088/1367-2630/9/6/206
Abstract
We improve the upper bound on the minimal resources required for measurement-based quantum computation. Minimizing the resources required for this model is a key issue for experimental realization of a quantum computer based on projective measurements. This new upper bound allows also to reply in the negative to the open question about the existence of a trade-off between observable and ancillary qubits in measurement-based quantum computation.
8 pages
References in corpus (11)
- Multi-party entanglement in graph states
- Resource-efficient linear optical quantum computation
- Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state
- Efficient quantum computation with probabilistic quantum gates
- Unified derivations of measurement-based schemes for quantum computation
- Parallelizing Quantum Circuits
- The one-way quantum computer -- a non-network model of quantum computation
- State Transfer instead of Teleportation in Measurement-based Quantum Computation
- Efficient Linear Optics Quantum Computation
- Unifying Quantum Computation with Projective Measurements only and One-Way Quantum Computation
- Universal quantum computation with two- and three-qubit projective measurements