scholarly journals Dipole–phonon quantum logic with alkaline-earth monoxide and monosulfide cations

2020 ◽  
Vol 22 (43) ◽  
pp. 24964-24973
Author(s):  
Michael Mills ◽  
Hao Wu ◽  
Evan C. Reed ◽  
Lu Qi ◽  
Kenneth R. Brown ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Logic ◽  
Alkaline Earth ◽  
Ion Trap ◽  
Molecular Ions ◽  
Phonon Interaction ◽  
Universal Quantum

We outline a path towards universal quantum computation using the dipole–phonon interaction of polar molecular ions in an ion trap.

scholarly journals Universal quantum computation with shutter logic

2006 ◽  
Vol 6 (6) ◽  
pp. 495-515
Author(s):  
J.C. Garcia-Escartin ◽  
P. Chamorro-Posada
Keyword(s):  
Quantum Computation ◽  
Quantum Logic ◽  
Quantum Computer ◽  
Quantum Memory ◽  
Linear Optics ◽  
Cnot Gate ◽  
Free Model ◽  
Universal Quantum

We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interaction-free model for a quantum shutter is given.

scholarly journals Extending matchgates into universal quantum computation

2011 ◽  
Vol 84 (2) ◽  
Author(s):  
Daniel J. Brod ◽  
Ernesto F. Galvão
Keyword(s):  
Quantum Computation ◽  
Universal Quantum

scholarly journals MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

2009 ◽  
Vol 07 (06) ◽  
pp. 1053-1203 ◽  
Author(s):  
ROBERT RAUßENDORF
Keyword(s):  
Computational Model ◽  
Quantum Computation ◽  
Quantum Logic ◽  
Network Model ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Cluster State ◽  
Building Blocks ◽  
Network Simulator ◽  
Classical Level

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.

Universal quantum computation with quantum-dot cellular automata in decoherence-free subspace

2008 ◽  
Vol 8 (10) ◽  
pp. 977-985
Author(s):  
Z.-Y. Xu ◽  
M. Feng ◽  
W.-M. Zhang
Keyword(s):  
Cellular Automata ◽  
Quantum Dot ◽  
Quantum Computation ◽  
Two Dimensions ◽  
High Fidelity ◽  
Electron Pairs ◽  
Quantum Dot Cellular Automata ◽  
Single Spin ◽  
Universal Quantum ◽  
Decoherence Free Subspace

We investigate the possibility to have electron-pairs in decoherence-free subspace (DFS), by means of the quantum-dot cellular automata (QCA) and single-spin rotations, to deterministically carry out a universal quantum computation with high-fidelity. We show that our QCA device with electrons tunneling in two dimensions is very suitable for DFS encoding, and argue that our design favors a scalable quantum computation robust to collective dephasing errors.

scholarly journals Roads towards fault-tolerant universal quantum computation

Nature ◽  
2017 ◽  
Vol 549 (7671) ◽  
pp. 172-179 ◽  
Author(s):  
Earl T. Campbell ◽  
Barbara M. Terhal ◽  
Christophe Vuillot
Keyword(s):  
Quantum Computation ◽  
Fault Tolerant ◽  
Universal Quantum
Sign in / Sign up

Export Citation Format

Share Document