scholarly journals Quantum computation is the unique reversible circuit model for which bits are balls

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Marius Krumm ◽  
Markus P. Müller
2019 ◽  
Vol 17 (03) ◽  
pp. 1950020
Author(s):  
Abderrahim Benmachiche ◽  
Ali Sellami ◽  
Sherzod Turaev ◽  
Derradji Bahloul ◽  
Azeddine Messikh ◽  
...  

Fundamental quantum gates can be implemented effectively using adiabatic quantum computation or circuit model. Recently, Hen combined the two approaches to introduce a new model called controlled adiabatic evolutions [I. Hen, Phys. Rev. A, 91(2) (2015) 022309]. This model was specifically designed to implement one and two-qubit controlled gates. Later, Santos extended Hen’s work to implement [Formula: see text]-qubit controlled gates [A. C. Santos and M. S. Sarandy, Sci. Rep., 5 (2015) 15775]. In this paper, we discuss the implementation of each of the usual quantum gates, as well as demonstrate the possibility of preparing Bell’s states using the controlled adiabatic evolutions approach. We conclude by presenting the fidelity results of implementing single quantum gates and Bell’s states in open systems.


2009 ◽  
Vol 180 (10) ◽  
pp. 1990-1998 ◽  
Author(s):  
Panagiotis Vlachos ◽  
Ioannis G. Karafyllidis

Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca

In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50


2014 ◽  
Vol 12 (05) ◽  
pp. 1450026 ◽  
Author(s):  
Tomoyuki Morimae

In the circuit model of quantum computation, a desired unitary gate can be implemented deterministically, whereas in the measurement-based model the unitary gate is implemented up to a byproduct operator. In order to compensate byproducts, following measurement angles must be adjusted, or classical results must be corrected. Such a feed-forwarding requires some classical processing and tuning of the measurement device, which cause the delay of computation and the additional decoherence. We show that if we respect the no-signaling principle, which is one of the most fundamental principles in physics, byproducts cannot be avoided in measurement-based quantum computation. Furthermore, we also show by using the idea of the quantum error correcting code that due to the no-signaling principle, not all byproducts are allowed in measurement-based quantum computation.


Author(s):  
Sergey Ulyanov ◽  
Andrey Reshetnikov ◽  
Olga Tyatyushkina ◽  
Vladimir Korenkov

All the quantum algorithms are based on a certain quantum computing model, varying from the quantum circuit, one-way quantum computation, adiabatic quantum computation and topological quantum computation. These four models are equivalent in computational power; among them, the quantum circuit model is most frequently used. In the circuit model, it has been proved that arbitrary single-qubit rotations plus twoqubit controlled-NOT gates are universal, i.e. they can provide a set of gates to implement any quantum algorithm. This article discusses the goal for this research: it is to given a lightning-fast (as-barebones-as-possible) definition of the quantum circuit model computing and leisurely development of quantum computation before actually getting around to sophisticated algorithms. In this article the main ideas of quantum software engineering is described.


2010 ◽  
Vol 10 (3&4) ◽  
pp. 258-271 ◽  
Author(s):  
M. Van den Nest

We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques. The normal form highlights why Clifford circuits have such limited computational power in spite of their high entangling power. At the same time, the normal form shows how the classical simulation of Clifford circuits fits into the standard way of embedding classical computation into the quantum circuit model. This leads to simple extensions of Clifford circuits which are classically simulatable. These circuits can be efficiently simulated by classical sampling (``weak simulation'') even though the problem of exactly computing the outcomes of measurements for these circuits (``strong simulation'') is proved to be $\#\mathbf{P}$-complete---thus showing that there is a separation between weak and strong classical simulation of quantum computation.


Sign in / Sign up

Export Citation Format

Share Document