Universality in quantum computation
From MaRDI portal
Publication:4861260
DOI10.1098/RSPA.1995.0065zbMATH Open0960.81512arXivquant-ph/9505018OpenAlexW3099429533WikidataQ56505526 ScholiaQ56505526MaRDI QIDQ4861260FDOQ4861260
Authors: David Deutsch, Adriano Barenco, Artur Ekert 
Publication date: 5 March 1996
Published in: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences (Search for Journal in Brave)
Abstract: We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.
Full work available at URL: https://arxiv.org/abs/quant-ph/9505018
Cited In (54)
- Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics
- The quantum secret sharing schemes based on hyperstar access structures
- QUANTUM COMPUTER: AN APPLIANCE FOR PLAYING MARKET GAMES
- GENERATING QUANTUM ENTANGLEMENT IN SCALABLE SUPERCONDUCTING CHARGE QUBITS
- Decomposition of unitary matrices and quantum gates
- A Hamiltonian for quantum copying
- Quantum computation based on retarded and advanced propagation.
- Noncommutative tori and universal sets of nonbinary quantum gates
- Quantum computation using the Aharonov-Casher set up
- Quantum limit on computational time and speed
- Quantum Computation over Continuous Variables
- A facile two-step method to implement \(N\sqrt {i\text{SWAP}}\) and \(N\sqrt {\text{SWAP}}\) gates in a circuit QED
- Quantum security computation on shared secrets
- Compiling quantum programs
- SPATIAL BELL STATE MEASUREMENT OF TWO PARTICLES
- Quantization of games: towards quantum artificial intelligence
- CONTROL OF QUANTUM SYSTEMS
- Models of quantum computation and quantum programming languages
- Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
- Neural networks with quantum architecture and quantum learning
- Quantum computation and quantum information†
- On the universality of almost every quantum logic gate.
- Unitary transformations can be distinguished locally
- Quantum computation by measurement and quantum memory
- Quantum circuits synthesis using Householder transformations
- Observable-geometric phases and quantum computation
- Universality of single-qudit gates
- Tight Binding Hamiltonians and Quantum Turing Machines
- Avoiding loss of fidelity for universal entangling geometric quantum gate
- A proposal for the realization of universal quantum gates via superconducting qubits inside a cavity
- Analytic controllability of time-dependent quantum control systems
- Efficient discrete approximations of quantum gates
- Holonomic quantum computation
- Quantum correlations in systems of indistinguishable particles
- Universal Classical Optical Computing Inspired by Quantum Information Process
- Hamiltonian quantum dynamics with separability constraints
- A geometric algebra perspective on quantum computational gates and universality in quantum computing
- Quantum information with continuous variables
- Quantum implicit computational complexity
- Quantum MIMO communication scheme based on quantum teleportation with triplet states
- Towards quantum computing based community detection
- Quantum information in the Posner model of quantum cognition
- Implementing scalable quantum computation with cavities
- A possible strategy to defeat decoherence in quantum computation: the role of symmetries, dynamical algebras, and all that.
- Quantum holonomies for quantum computing
- A rigorous approach to the Feynman-Vernon influence functional and its applications. I
- Geometric phases and quantum computations
- Common entanglement witnesses and their characteristics
- An algorithmic construction of quantum circuits of high descriptive complexity
- QUANTUM COMPUTATION BY MEASUREMENTS
- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- \textit{OptQC}: an optimized parallel quantum compiler
- Simulation and reversal of n -qubit Hamiltonians using Hadamard matrices
- Time-optimal decompositions in \(\mathrm{SU}(2)\)
This page was built for publication: Universality in quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4861260)
