A universal two-bit gate for quantum computation

DOI10.1098/rspa.1995.0066zbMath0960.81511arXivquant-ph/9505016OpenAlexW1992769799WikidataQ59442135 ScholiaQ59442135MaRDI QIDQ4861261

Adriano Barenco

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)

Full work available at URL: https://arxiv.org/abs/quant-ph/9505016

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (39)

Quantum computing with spin qubits in semiconductor structures ⋮ A new universal and fault-tolerant quantum basis ⋮ A QUANTUM PERCEPTRON ⋮ Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels ⋮ Linear entropy of two-qubit gates and majorization ⋮ Quantum Computations with Polarized Photons ⋮ Simple permutations mix even better ⋮ Quantum computing via the Bethe ansatz ⋮ Quantum public-key cryptosystem ⋮ Cyclic groups and quantum logic gates ⋮ Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons ⋮ Quantum circuits synthesis using Householder transformations ⋮ A geometric algebra perspective on quantum computational gates and universality in quantum computing ⋮ CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME ⋮ Optimal LSBs-based quantum watermarking with lower distortion ⋮ Quantum computation in quantum-Hall systems. ⋮ A Hamiltonian for quantum copying ⋮ Writing quantum data into one-way quantum computer by fusion gate ⋮ Quantization of Soliton Cellular Automata ⋮ Neural networks with quantum architecture and quantum learning ⋮ Compiling quantum programs ⋮ Quantum phase transitions and vortex dynamics in superconducting networks ⋮ A QUANTUM NEURAL NETWORK MODEL ⋮ Information and computation: Classical and quantum aspects ⋮ Quantum computation and quantum information† ⋮ Simulation and reversal of n -qubit Hamiltonians using Hadamard matrices ⋮ Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits ⋮ Efficient algebraic representation of quantum circuits ⋮ Characterization of two-qubit perfect entanglers ⋮ Evaluating the Flexibility of A* for Mapping Quantum Circuits ⋮ Unitary Transformations Can Be Distinguished Locally ⋮ The ghost in the radiation: robust encodings of the black hole interior ⋮ Primality Test Via Quantum Factorization ⋮ Implementation of generalized measurements with minimal disturbance on a quantum computer ⋮ Demonstration of a Fundamental Quantum Logic Gate ⋮ Measurement of Conditional Phase Shifts for Quantum Logic ⋮ Programmable Quantum Gate Arrays ⋮ Quantum Computation with Phase Drift Errors ⋮ PSPACE has constant-round quantum interactive proof systems

This page was built for publication: A universal two-bit gate for quantum computation