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

arXiv:quant-ph/0201132 · Journal of Experimental and Theoretical Physics Letters

Realization of the quantum Fourier transform and simulation of a wave function on a quantum computer with fixed continuous interaction

Yu. I. Ozhigov

Published Nov 1, 2002• 2 citations
arXivHTMLPDF

Abstract

A model of a quantum computer with diagonal continuous interaction between qubits is proposed. Such a computer is controlled only by short single-qubit operations. The realization of quantum Fourier transform and simulation of the wave function of a many-particle problem with linear and quadratic potentials on this quantum computer are discussed. This method applies to a wide class of diagonal interactions and to the case, where the interactions of different qubits are different.

DOI
10.1134/1.1541053

Related papers

Qubit-qubit interaction in quantum computers. II. Adder algorithm with diagonal and off-diagonal interactions

Julio R. Gea-Banacloche

The effect of off-diagonal interactions between quantum bits is studied in a simple quantum computer algorithm designed to calculate the sum of two n-bit numbers. Scaling laws are derived numerically for the dependence of the error on the number n of bits, the strength of the interaction, and the calculation time. The case of diagonal interactions, previously studied in the context of the quantum Fourier transform algorithm, is also considered. No substantial differences are found between the off-diagonal and diagonal forms of the interaction: in both cases, the errors accumulate almost coherently, despite the fact that the system's free evolution is constantly being interrupted by the logical gates, which scramble the coefficients of the wave function. Some comments on the possibility of using ``field-insensitive'' atomic states in ion-chain quantum computers are also given.

Physical Review A•Jul 1, 1999•9 citations

The Simulation of Quantum Fourier Transform

Yanhua Zhong

At present, it is one of various effective approaches for quantum algorithm to using the nuclear magnetic resonance (NMR) experiment technology. NMR uses radio frequency (RF) electromagnetic pulses to rotate the spins. By tuning the frequency of the RF-field to the precession frequency of a particular spin, the power of the applied pulse controls how much the spin will rotate. The axis of the rotation is determined by the direction of the applied RF-field. By selecting the appropriate RF pulses, arbitrary single-spin rotation can be carried out. In other words, using RF pulses we can perform any single-qubit operation. Communication between the qubits is accomplished through the spin-spin interaction in model. A simulation approach in this paper is described to realize quantum Fourier transform algorithm (QFT).

Microcomputer applications•Jan 1, 2006•0 citations

Another Way to Perform the Quantum Fourier Transform in Linear Parallel Time

Cristopher Moore

. We exhibit a quantum circuit that performs the Quantum Fourier Transform on n qubits in O(n) depth. Thus, a parallel quantum computer can carry out the QFT in linear time. Griffiths and Niu have already shown this, so this paper is little more than an exercise in quantum circuit design; but perhaps it illustrates a worthwhile idea. We also speculate as to whether the QFT might be in the class QNC 1 of problems solvable in logarithmic parallel time. Shor's factoring algorithm [6] suggests that quantum computers can do things in polynomial time that classical computers cannot. However, since decoherence due to storage errors is a function of time, we should also ask to what extent we can parallelize quantum algorithms; if we can do many quantum operations at once, rather than serially, we can solve larger problems before our computer decoheres. Consider a quantum circuit operating on a set of qubits, containing onequbit gates (2 \\Theta 2 unitary matrices) and the two-qubit controlled...

arXiv:quant-ph/9801038•Jan 19, 1998•1 citation

The Study of Simulation Technique of Quantum Compute and Quantum Fourier Transform

Jiajia Wang, Hanwu Chen, Zhiqiang Li

For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.

International Conference on Computer Supported Cooperative Work in Design (CSCWD)•Apr 1, 2007•3 citations

Processor Core Model for Quantum Computing

Man‐Hong Yung, Simon C. Benjamin, Sougato Bose

We describe an architecture based on a processing "core," where multiple qubits interact perpetually, and a separate "store," where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the core, and free evolution of the core. This enables computation using physical systems where the entangling interactions are "always on." Alternatively, for switchable systems, our model constitutes a prescription for optimizing many-qubit gates. We discuss implementations of the quantum Fourier transform, Hamiltonian simulation, and quantum error correction.

arXiv:quant-ph/0508165•Physical Review Letters•Jun 5, 2006•34 citations

Synthesis of and compilation with time-optimal multi-qubit gates

Pascal Baßler, Matthias Zipper, Christopher Cedzich +4 more

We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it can be switched on and off for individual qubits. Our method yields a time-optimal implementation of the multi-qubit gates. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits. Using this gate synthesis as a subroutine, we provide compilation strategies for important use cases: (i) we show that any Clifford circuit on n qubits can be implemented using at most 2 n multi-qubit gates without requiring ancilla qubits, (ii) we decompose the quantum Fourier transform in a similar fashion, (iii) we compile a simulation of molecular dynamics, and (iv) we propose a method for the compilation of diagonal unitaries with time-optimal multi-qubit gates, as a step towards general unitaries. As motivation, we provide a detailed discussion on a microwave controlled ion trap architecture with magnetic gradient induced coupling (MAGIC) for the generation of the Ising-type interactions.

arXiv:2206.06387•Quantum•Apr 20, 2023•34 citations
A model of a quantum computer with diagonal continuous interaction between qubits is proposed. Such a computer is controlled only by short single-qubit operations. The realization of quantum Fourier transform and simulation of the wave function of a many-particle problem with linear and quadratic potentials on this quantum computer are discussed. This method applies to a wide class of diagonal interactions and to the case, where the interactions of different qubits are different.
The effect of off-diagonal interactions between quantum bits is studied in a simple quantum computer algorithm designed to calculate the sum of two n-bit numbers. Scaling laws are derived numerically for the dependence of the error on the number n of bits, the strength of the interaction, and the calculation time. The case of diagonal interactions, previously studied in the context of the quantum Fourier transform algorithm, is also considered. No substantial differences are found between the off-diagonal and diagonal forms of the interaction: in both cases, the errors accumulate almost coherently, despite the fact that the system's free evolution is constantly being interrupted by the logical gates, which scramble the coefficients of the wave function. Some comments on the possibility of using ``field-insensitive'' atomic states in ion-chain quantum computers are also given.
At present, it is one of various effective approaches for quantum algorithm to using the nuclear magnetic resonance (NMR) experiment technology. NMR uses radio frequency (RF) electromagnetic pulses to rotate the spins. By tuning the frequency of the RF-field to the precession frequency of a particular spin, the power of the applied pulse controls how much the spin will rotate. The axis of the rotation is determined by the direction of the applied RF-field. By selecting the appropriate RF pulses, arbitrary single-spin rotation can be carried out. In other words, using RF pulses we can perform any single-qubit operation. Communication between the qubits is accomplished through the spin-spin interaction in model. A simulation approach in this paper is described to realize quantum Fourier transform algorithm (QFT).
. We exhibit a quantum circuit that performs the Quantum Fourier Transform on n qubits in O(n) depth. Thus, a parallel quantum computer can carry out the QFT in linear time. Griffiths and Niu have already shown this, so this paper is little more than an exercise in quantum circuit design; but perhaps it illustrates a worthwhile idea. We also speculate as to whether the QFT might be in the class QNC 1 of problems solvable in logarithmic parallel time. Shor's factoring algorithm [6] suggests that quantum computers can do things in polynomial time that classical computers cannot. However, since decoherence due to storage errors is a function of time, we should also ask to what extent we can parallelize quantum algorithms; if we can do many quantum operations at once, rather than serially, we can solve larger problems before our computer decoheres. Consider a quantum circuit operating on a set of qubits, containing onequbit gates (2 \\Theta 2 unitary matrices) and the two-qubit controlled...
For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.
We describe an architecture based on a processing "core," where multiple qubits interact perpetually, and a separate "store," where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the core, and free evolution of the core. This enables computation using physical systems where the entangling interactions are "always on." Alternatively, for switchable systems, our model constitutes a prescription for optimizing many-qubit gates. We discuss implementations of the quantum Fourier transform, Hamiltonian simulation, and quantum error correction.
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it can be switched on and off for individual qubits. Our method yields a time-optimal implementation of the multi-qubit gates. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits. Using this gate synthesis as a subroutine, we provide compilation strategies for important use cases: (i) we show that any Clifford circuit on n qubits can be implemented using at most 2 n multi-qubit gates without requiring ancilla qubits, (ii) we decompose the quantum Fourier transform in a similar fashion, (iii) we compile a simulation of molecular dynamics, and (iv) we propose a method for the compilation of diagonal unitaries with time-optimal multi-qubit gates, as a step towards general unitaries. As motivation, we provide a detailed discussion on a microwave controlled ion trap architecture with magnetic gradient induced coupling (MAGIC) for the generation of the Ising-type interactions.