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

Journal of Experimental and Theoretical Physics Letters

Quantum computations with ensembles of identical fermions and static interaction

Yu. I. Ozhigov

Published May 1, 2011• 1 citation
Publisher

Abstract

A simplified scheme has been proposed for quantum computations on ensembles of identical fermions with quadratic slowing as compared to the abstract scheme of a quantum computer. An advantage of the proposed scheme is tunneling control, whereas the interaction between qubits is assumed to be diagonal and does not require control. It is reasonable to use the proposed scheme to implement fast quantum algorithms, in particular, Shor’s algorithm.

DOI
10.1134/s0021364011050080

Related papers

Algorithms on ensemble quantum computers

P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +1 more

In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement.

Natural Computing•May 29, 2009•16 citations

Quantum finite difference solvers for physics simulation

Anthony Chagneau, Laëticia Nathoo, Jérémy Alloul +1 more

Abstract Physics systems are becoming increasingly complex and require more and more computing time. Quantum computing, which has shown its efficiency on some problems, such as the factorisation of a number with Shor's algorithm, may be the solution to reduce these computation times. Here, the authors propose two quantum numerical schemes for the simulation of physics phenomena, based on the finite difference method. The aim is to see if quantum versions of standard numerical schemes offer an advantage over their classical counterparts, either in accuracy, stability or computation time. First, the authors will present the different phenomena studied as well as the classical solution methods chosen. The authors will then describe the implementation of the quantum numerical schemes and present some results obtained on the different physics phenomena beforehand and then compare both approaches, classical and quantum.

IET Quantum Communication•Mar 3, 2023•6 citations

Realistic models of a quantum computer

Yuri Ozhigov

We study a realistic quantum computational model with the permanent interaction of diagonal type between qubits. Its universality was proven in quant-ph/0202030. We propose two types of control over computations: random and periodical NOTs. The slowdown of computations in comparison with the abstract model is estimated. It is shown how fermionic computations can be implemented in the framework of this model.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•0 citations

Quantum Computing Without Local Control of Qubit-Qubit Interactions

Simon C. Benjamin

If the interaction between qubits is not diagonal in the computational basis (e.g., the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, schemes for quantum computing typically demand local control of the interaction strength between each pair of neighboring qubits. Here we demonstrate that this degree of control is not necessary: it suffices to switch the interaction collectively, something that can in principle be achieved by global fields rather than with local manipulations. This observation may offer a significant simplification for various implementations, including solid state and optical lattice schemes.

arXiv:quant-ph/0104117•Physical Review Letters•Dec 19, 2001•86 citations

A quantum computer in the scheme of an atomic quantum transistor with logical encoding of qubits

Sergey A. Moiseev, S. N. Andrianov, E. S. Moiseev

A scheme of a multiqubit quantum computer on atomic ensembles using a quantum transistor implementing two qubit gates is proposed. We demonstrate how multiatomic ensembles permit one to work with a large number of qubits that are represented in a logical encoding in which each qubit is recorded on a superposition of single-particle states of two atomic ensembles. The access to qubits is implemented by appropriate phasing of quantum states of each of atomic ensembles. An atomic quantum transistor is proposed for use when executing two qubit operations. The quantum transistor effect appears when an excitation quantum is exchanged between two multiatomic ensembles located in two closely positioned QED cavities connected with each other by a gate atom. The dynamics of quantum transfer between atomic ensembles can be different depending on one of two states of the gate atom. Using the possibilities of control for of state of the gate atom, we show the possibility of quantum control for the state of atomic ensembles and, based on this, implementation of basic single and two qubit gates. Possible implementation schemes for a quantum computer on an atomic quantum transistor and their advantages in practical implementation are discussed.

Optics and Spectroscopy•Sep 1, 2013•15 citations

Parallel quantum computing in a single ensemble quantum computer

Gui Lu Long, Xiao Li

We propose a parallel quantum computing mode for ensemble quantum computer. In this mode, some qubits are in pure states while other qubits are in mixed states. It enables a single ensemble quantum computer to perform ``single-instruction-multidata'' type of parallel computation. Parallel quantum computing can provide additional speedup in Grover's algorithm and Shor's algorithm. In addition, it also makes a fuller use of qubit resources in an ensemble quantum computer. As a result, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani and the Cleve-DiVincenzo algorithms can be reutilized.

arXiv:quant-ph/0307055•Physical Review A•May 6, 2004•78 citations
A simplified scheme has been proposed for quantum computations on ensembles of identical fermions with quadratic slowing as compared to the abstract scheme of a quantum computer. An advantage of the proposed scheme is tunneling control, whereas the interaction between qubits is assumed to be diagonal and does not require control. It is reasonable to use the proposed scheme to implement fast quantum algorithms, in particular, Shor’s algorithm.
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement.
Abstract Physics systems are becoming increasingly complex and require more and more computing time. Quantum computing, which has shown its efficiency on some problems, such as the factorisation of a number with Shor's algorithm, may be the solution to reduce these computation times. Here, the authors propose two quantum numerical schemes for the simulation of physics phenomena, based on the finite difference method. The aim is to see if quantum versions of standard numerical schemes offer an advantage over their classical counterparts, either in accuracy, stability or computation time. First, the authors will present the different phenomena studied as well as the classical solution methods chosen. The authors will then describe the implementation of the quantum numerical schemes and present some results obtained on the different physics phenomena beforehand and then compare both approaches, classical and quantum.
If the interaction between qubits is not diagonal in the computational basis (e.g., the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, schemes for quantum computing typically demand local control of the interaction strength between each pair of neighboring qubits. Here we demonstrate that this degree of control is not necessary: it suffices to switch the interaction collectively, something that can in principle be achieved by global fields rather than with local manipulations. This observation may offer a significant simplification for various implementations, including solid state and optical lattice schemes.
A scheme of a multiqubit quantum computer on atomic ensembles using a quantum transistor implementing two qubit gates is proposed. We demonstrate how multiatomic ensembles permit one to work with a large number of qubits that are represented in a logical encoding in which each qubit is recorded on a superposition of single-particle states of two atomic ensembles. The access to qubits is implemented by appropriate phasing of quantum states of each of atomic ensembles. An atomic quantum transistor is proposed for use when executing two qubit operations. The quantum transistor effect appears when an excitation quantum is exchanged between two multiatomic ensembles located in two closely positioned QED cavities connected with each other by a gate atom. The dynamics of quantum transfer between atomic ensembles can be different depending on one of two states of the gate atom. Using the possibilities of control for of state of the gate atom, we show the possibility of quantum control for the state of atomic ensembles and, based on this, implementation of basic single and two qubit gates. Possible implementation schemes for a quantum computer on an atomic quantum transistor and their advantages in practical implementation are discussed.
We propose a parallel quantum computing mode for ensemble quantum computer. In this mode, some qubits are in pure states while other qubits are in mixed states. It enables a single ensemble quantum computer to perform ``single-instruction-multidata'' type of parallel computation. Parallel quantum computing can provide additional speedup in Grover's algorithm and Shor's algorithm. In addition, it also makes a fuller use of qubit resources in an ensemble quantum computer. As a result, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani and the Cleve-DiVincenzo algorithms can be reutilized.