Universality in quantum computation

From MaRDI portal
Publication:4861260

DOI10.1098/rspa.1995.0065zbMath0960.81512arXivquant-ph/9505018OpenAlexW3099429533WikidataQ56505526 ScholiaQ56505526MaRDI QIDQ4861260

Artur Ekert, Adriano Barenco, David Deutsch

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/9505018




Related Items

Quantum limit on computational time and speedA facile two-step method to implement \(N\sqrt {i\text{SWAP}}\) and \(N\sqrt {\text{SWAP}}\) gates in a circuit QEDQuantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid DynamicsUnnamed ItemDECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATESNoncommutative tori and universal sets of nonbinary quantum gatesScalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channelsEfficient discrete approximations of quantum gatesUniversality of single-qudit gatesGENERATING QUANTUM ENTANGLEMENT IN SCALABLE SUPERCONDUCTING CHARGE QUBITSUniversal Classical Optical Computing Inspired by Quantum Information ProcessCommon entanglement witnesses and their characteristicsQuantum circuits synthesis using Householder transformationsA geometric algebra perspective on quantum computational gates and universality in quantum computingTime-optimal decompositions in \(\mathrm{SU}(2)\)Quantum MIMO communication scheme based on quantum teleportation with triplet statesA proposal for the realization of universal quantum gates via superconducting qubits inside a cavityA Hamiltonian for quantum copyingA rigorous approach to the Feynman-Vernon influence functional and its applications. IQuantum security computation on shared secretsOn the universality of almost every quantum logic gateHamiltonian quantum dynamics with separability constraintsNeural networks with quantum architecture and quantum learningModels of quantum computation and quantum programming languages\textit{OptQC}: an optimized parallel quantum compilerAn Algorithmic Construction of Quantum Circuits of High Descriptive ComplexityQUANTUM COMPUTER: AN APPLIANCE FOR PLAYING MARKET GAMESCompiling quantum programsSPATIAL BELL STATE MEASUREMENT OF TWO PARTICLESQuantum correlations in systems of indistinguishable particlesQUANTUM HOLONOMIES FOR QUANTUM COMPUTINGQuantum computation using the Aharonov-Casher set upQUANTUM COMPUTATION BY MEASUREMENTSQuantization of games: towards quantum artificial intelligencePhase semantics and Petri net interpretation for resource-sensitive strong negationQuantum information with continuous variablesQuantum computation and quantum information†CONTROL OF QUANTUM SYSTEMSObservable-geometric phases and quantum computationSimulation and reversal of n -qubit Hamiltonians using Hadamard matricesTowards quantum computing based community detectionHolonomic quantum computationQuantum information in the Posner model of quantum cognitionUnitary Transformations Can Be Distinguished LocallyAvoiding loss of fidelity for universal entangling geometric quantum gateQuantum implicit computational complexityQuantum computation based on retarded and advanced propagation.Tight Binding Hamiltonians and Quantum Turing MachinesQuantum Computation over Continuous VariablesGeometric phases and quantum computationsQuantum computation by measurement and quantum memoryAnalytic controllability of time-dependent quantum control systemsImplementing scalable quantum computation with cavities