Results 1 to 10 of about 107,984 (118)
Quantum gates by periodic driving. [PDF]
Sci Rep, 2016 AbstractTopological quantum computation has been extensively studied in the past decades due to its robustness against decoherence. One way to realize the topological quantum computation is by adiabatic evolutions—it requires relatively long time to complete a gate, so the speed of quantum computation slows down.
Shi ZC, Wang W, Yi XX.
europepmc +6 more sources
Elementary gates for quantum computation [PDF]
Physical Review A, 1995 We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U ...
A. C. C. Yao +33 more
core +14 more sources
Experimental superposition of orders of quantum gates. [PDF]
Nat Commun, 2015 AbstractQuantum computers achieve a speed-up by placing quantum bits (qubits) in superpositions of different states. However, it has recently been appreciated that quantum mechanics also allows one to ‘superimpose different operations’. Furthermore, it has been shown that using a qubit to coherently control the gate order allows one to accomplish a ...
Procopio LM +9 more
europepmc +9 more sources
Addressable Quantum Gates [PDF]
ACM Transactions on Quantum Computing, 2023 We extend the circuit model of quantum computation so that the wiring between gates is soft-coded within registers inside the gates. The addresses in these registers can be manipulated and put into superpositions. This aims at capturing indefinite causal orders and making their geometrical layout explicit: we express the quantum switch and the ...
Pablo Arrighi +4 more
openaire +3 more sources
Frontiers in Optics 2016, 2016 A quantum controlled-SWAP gate is demonstrated and used to implement small-scale algorithms and produce high-fidelity GHZ states.
Raj B. Patel +5 more
openaire +6 more sources
A SEQUENCE OF QUANTUM GATES [PDF]
International Journal of Geometric Methods in Modern Physics, 2012 We study a sequence of quantum gates in finite-dimensional Hilbert spaces given by the normalized eigenvectors of the unitary operators. The corresponding sequence of the Hamilton operators is also given. From the Hamilton operators we construct another hierarchy of quantum gates via the Cayley transform.
Steeb, Willi-Hans, Hardy, Yorick
openaire +4 more sources
Unsupervised Quantum Gate Control for Gate-Model Quantum Computers [PDF]
Scientific Reports, 2020 AbstractIn near-term quantum computers, the operations are realized by unitary quantum gates. The precise and stable working mechanism of quantum gates is essential for the implementation of any complex quantum computations. Here, we define a method for the unsupervised control of quantum gates in near-term quantum computers.
Laszlo Gyongyosi +2 more
openaire +3 more sources
A unified quantum NOT gate [PDF]
Journal of Physics A: Mathematical and Theoretical, 2009 We study the feasibility of implementing a quantum NOT gate (approximate) when the quantum state lies between two latitudes on the Bloch's sphere and present an analytical formula for the optimized 1-to-$M$ quantum NOT gate. Our result generalizes previous results concerning quantum NOT gate for a quantum state distributed uniformly on the whole Bloch ...
Yu, Z.-W. +3 more
openaire +3 more sources
Design of Gates for Quantum Computation: The NOT Gate [PDF]
International Journal of Modern Physics B, 1997 We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first step in the development of this approach.
Steven P. Hotaling +2 more
openaire +3 more sources
Decomposition of quantum gates [PDF]
International Journal of Quantum Information, 2014 A recurrence scheme is presented to decompose an n-qubit unitary gate to the product of no more than N(N - 1)/2 single qubit gates with small number of controls, where N = 2n. Detailed description of the recurrence steps and formulas for the number of k-controlled single qubit gates in the decomposition are given.
Diane Christine Pelejo, Chi-Kwong Li
openaire +3 more sources