State Transfer instead of Teleportation in Measurement-based Quantum Computation
arXiv:quant-ph/0402204 · doi:10.1142/S0219749905000785
Abstract
Quantum measurement is universal for quantum computation. The model of quantum computation introduced by Nielsen and further developed by Leung relies on a generalized form of teleportation. In order to simulate any n-qubit unitary transformation with this model, 4 auxiliary qubits are required. Moreover Leung exhibited a universal family of observables composed of 4 two-qubit measurements. We introduce a model of quantum computation via measurements only, relying on state transfer: state transfer only retains the part of teleportation which is necessary for computating. In order to simulate any n-qubit unitary transformation with this new model, only one auxiliary qubit is required. Moreover we exhibit a universal family of observables composed of 3 one-qubit measurements and only one two-qubit measurement. This model improves those of Nielsen and Leung in terms of both the number of auxiliary qubits and the number of two-qubit measurements required for quantum universality. In both cases, the minimal amounts of necessary resources are now reached: one auxiliary qubit (because measurement is destructive) and one two-qubit measurement (for creating entanglement).
7 pages, 11 figures
References in corpus (4)
Cited by in corpus (17)
- Unified derivations of measurement-based schemes for quantum computation
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Computation by measurements: a unifying picture
- State Transfer instead of Teleportation in Measurement-based Quantum Computation
- Level Reduction and the Quantum Threshold Theorem
- Lineal: A linear-algebraic Lambda-calculus
- Measurement-Based Quantum Computation
- Measurement-Based Quantum Turing Machines and their Universality
- Graph States, Pivot Minor, and Universality of (X,Z)-measurements
- Towards Minimal Resources of Measurement-based Quantum Computation
- The Measurement Calculus
- Complexity of Graph State Preparation
- Quantum Games and Programmable Quantum Systems
- Bases in diagrammatic quantum protocols
- Computational depth complexity of measurement-based quantum computation
- Simple Sets of Measurements for Universal Quantum Computation and Graph State Preparation
- Reducing depth and measurement weights in Pauli-based computation