scholarly journals Error-Robust Quantum Logic Optimization Using a Cloud Quantum Computer Interface

2021 ◽  
Vol 15 (6) ◽  
Author(s):  
Andre R. R. Carvalho ◽  
Harrison Ball ◽  
Michael J. Biercuk ◽  
Michael R. Hush ◽  
Felix Thomsen
Keyword(s):  
Quantum Logic ◽  
Quantum Computer ◽  
Computer Interface ◽  
Logic Optimization

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.

Computational model underlying the one-way quantum computer

2002 ◽  
Vol 2 (6) ◽  
pp. 443-486
Author(s):  
R. Raussendorf ◽  
H. Briegel
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Computational Model ◽  
Quantum Logic ◽  
Quantum Information Processing ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Single Step ◽  
Clifford Group ◽  
The One

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. {\bf{86}}, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.

IMPLEMENTATION OF QUANTUM LOGIC OPERATIONS AND CREATION OF ENTANGLEMENT BETWEEN TWO NUCLEAR SPIN QUBITS WITH CONSTANT INTERACTION

2006 ◽  
Vol 04 (06) ◽  
pp. 975-1001
Author(s):  
G. P. BERMAN ◽  
G. W. BROWN ◽  
M. E. HAWLEY ◽  
D. I. KAMENEV ◽  
V. I. TSIFRINOVICH
Keyword(s):  
Quantum Logic ◽  
Quantum Computer ◽  
Magnetic Field Gradient ◽  
Exchange Interactions ◽  
Conditional Logic ◽  
Perturbation Approach ◽  
Nuclear Spins ◽  
Logic Operations ◽  
Quantum Protocol ◽  
Silicon Based

We describe how to implement quantum logic operations in a silicon-based quantum computer with phosphorus atoms serving as qubits. The information is stored in the states of nuclear spins and the conditional logic operations are implemented through the electron spins using nuclear–electron hyperfine and electron–electron exchange interactions. The electrons in our computer should stay coherent only during implementation of one Controlled-NOT gate. The exchange interaction is constant, and selective excitations are provided by a magnetic field gradient. The quantum logic operations are implemented by rectangular radio-frequency pulses. This architecture is scalable and does not require manufacturing nanoscale electronic gates. As shown in this paper, parameters of a quantum protocol can be derived analytically even for a computer with a large number of qubits using our perturbation approach. We present the protocol for initialization of the nuclear spins and the protocol for creation of entanglement. All analytical results are tested numerically using a two-qubit system.

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.

Quantum Computing I

2020 ◽  
pp. 229-244
Author(s):  
M. Suhail Zubairy
Keyword(s):  
Quantum Logic ◽  
Quantum Teleportation ◽  
Quantum Computer ◽  
Logic Gates ◽  
Building Blocks ◽  
Quantum Mechanical ◽  
Quantum Dense Coding ◽  
Quantum Logic Gates ◽  
Probabilistic Nature ◽  
Conventional Computer

A remarkable application of quantum mechanical concepts of coherent superposition and quantum entanglement is a quantum computer which can solve certain problems at speeds unbelievably faster than the conventional computer. In this chapter, the basic principles and the conditions for the implementation of the quantum computer are introduced and the limitations imposed by the probabilistic nature of quantum mechanics and the inevitable decoherence phenomenon are discussed. Next the basic building blocks, the quantum logic gates, are introduced. These include the Hadamard, the CNOT, and the quantum phase gates. After these preliminaries, the implementation of the Deutsch algorithm, quantum teleportation, and quantum dense coding in terms of the quantum logic gates are discussed. It is also shown how the Bell states can be produced and measured using a sequence of quantum logic gates.

scholarly journals Simulations of quantum-logic operations in a quantum computer with a large number of qubits

2000 ◽  
Vol 61 (6) ◽  
Author(s):  
G. P. Berman ◽  
G. D. Doolen ◽  
G. V. López ◽  
V. I. Tsifrinovich
Keyword(s):  
Quantum Logic ◽  
Quantum Computer ◽  
Logic Operations
Sign in / Sign up

Export Citation Format

Share Document