Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Fortschritte der Physik

Quantum Simulators and Quantum Repeaters

Mladen Pavičić

Published May 1, 2000• 0 citations
Publisher

Abstract

Two elements of quantum computation are considered: quantum computer logic and quantum repeater. It is shown that the quantum gate logic does have two different models and that it is therefore ambiguous. It is also shown that without additional conditions imposed on quantum gates one cannot arrive at a general quantum computer machine language. In absence of such conditions quantum entanglement remains a selection protocol which makes quantum computer equivalent to many photon intensity interferometry. As an example for such an entanglement we discuss a quantum optical repeater.

DOI
10.1002/(sici)1521-3978(200005)48:5/7<497::aid-prop497>3.0.co;2-t

Related papers

Quantum Logic Using Linear Optics

J. D. Franson, B. C. Jacobs, T. B. Pittman

In order for quantum communications systems to become widely used, it will probably be necessary to develop quantum repeaters that can extend the range of quantum key distribution systems and correct for errors in the transmission of quantum information. Quantum logic gates based on linear optical techniques appear to be a promising approach for the development of quantum repeaters, and they may have applications in quantum computing as well. Here we describe the basic principles of logic gates based on linear optics, along with the results from several experimental demonstrations of devices of this kind. A prototype source of single photons and a quantum memory device for photons are also discussed. These devices can be combined with a four-qubit encoding to implement a quantum repeater.

arXiv:quant-ph/0402097•Feb 15, 2004•0 citations

1BASIC LOGIC AND QUANTUM ENTANGLEMENT

P. A. Zizzi

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But...can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.

•Nov 10, 2006•12 citations

Quantum computation

This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations

Comparison of Classical Logic Gates with Quantum Logic Gates

Liang Liu

In this article,we describe the differences between classical logic gates and quantum logic gates,and explain the characteristics of quantum computation,the strong power of the quantum algorithm,and the problem of the realization of quantum logic gates.

Computer Engineering and Science•Jan 1, 2005•0 citations

Conditional Quantum Dynamics and Logic Gates

Adriano Barenco, David Deutsch, ARTUR K. EKERT +1 more

Quantum logic gates provide fundamental examples of conditional quantum dynamics. They could form the building blocks of general quantum information processing systems which have recently been shown to have many interesting nonclassical properties. We describe a simple quantum logic gate, the quantum controlled-NOT, and analyze some of its applications. We discuss two possible physical realizations of the gate, one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole-dipole interaction.

arXiv:quant-ph/9503017•Physical Review Letters•May 15, 1995•971 citations

Quantum computer simulator based on the circuit model of quantum computation

Ioannis G. Karafyllidis

A quantum computer simulator is presented. This simulator is an engineering work and no deep understanding of quantum mechanics is required from the user. The simulator is based on the circuit model of quantum computation in which quantum gates act on quantum registers which comprise a number of quantum bits (qubits). The inputs to the simulator are the initial states of the qubits that form a quantum register and the quantum gates applied at each computation step. The inputs are entered through a graphical user interface. The outputs of the simulator are the matrices that represent the quantum register state at each quantum computation step and graphical outputs that show the probability of measuring each one of the possible quantum register base states and the phase of each state at each computation step. The well-known Deutsch's algorithm and the quantum Fourier transform, which is the base of many quantum algorithms, are presented using this simulator. Furthermore, the generation and variation of entanglement during quantum computations can be calculated using this simulator. The quantum computer simulator is a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms.

IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications•Aug 1, 2005•56 citations
Two elements of quantum computation are considered: quantum computer logic and quantum repeater. It is shown that the quantum gate logic does have two different models and that it is therefore ambiguous. It is also shown that without additional conditions imposed on quantum gates one cannot arrive at a general quantum computer machine language. In absence of such conditions quantum entanglement remains a selection protocol which makes quantum computer equivalent to many photon intensity interferometry. As an example for such an entanglement we discuss a quantum optical repeater.
In order for quantum communications systems to become widely used, it will probably be necessary to develop quantum repeaters that can extend the range of quantum key distribution systems and correct for errors in the transmission of quantum information. Quantum logic gates based on linear optical techniques appear to be a promising approach for the development of quantum repeaters, and they may have applications in quantum computing as well. Here we describe the basic principles of logic gates based on linear optics, along with the results from several experimental demonstrations of devices of this kind. A prototype source of single photons and a quantum memory device for photons are also discussed. These devices can be combined with a four-qubit encoding to implement a quantum repeater.
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But...can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.
Quantum logic gates provide fundamental examples of conditional quantum dynamics. They could form the building blocks of general quantum information processing systems which have recently been shown to have many interesting nonclassical properties. We describe a simple quantum logic gate, the quantum controlled-NOT, and analyze some of its applications. We discuss two possible physical realizations of the gate, one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole-dipole interaction.
A quantum computer simulator is presented. This simulator is an engineering work and no deep understanding of quantum mechanics is required from the user. The simulator is based on the circuit model of quantum computation in which quantum gates act on quantum registers which comprise a number of quantum bits (qubits). The inputs to the simulator are the initial states of the qubits that form a quantum register and the quantum gates applied at each computation step. The inputs are entered through a graphical user interface. The outputs of the simulator are the matrices that represent the quantum register state at each quantum computation step and graphical outputs that show the probability of measuring each one of the possible quantum register base states and the phase of each state at each computation step. The well-known Deutsch's algorithm and the quantum Fourier transform, which is the base of many quantum algorithms, are presented using this simulator. Furthermore, the generation and variation of entanglement during quantum computations can be calculated using this simulator. The quantum computer simulator is a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms.