Results 91 to 100 of about 2,036,649 (124)
Quantum Fourier transform in computational basis [PDF]
Quantum Information Processing, 2017 revised discussion and reference mainly in section 4, minor changes in the result section, as well as corrected ...
Jingbo Wang
exaly +4 more sources
Quantum algorithms and the Fourier transform [PDF]
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998 18 pages Latex.
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Simulating the Quantum Fourier Transform
2013 2nd Workshop-School on Theoretical Computer Science, 2013Quantum Computing is a computational paradigm that takes into account the laws of Quantum Physics in the steps of the computation which advantages were verified both in Computation and Communications. No scalable quantum computer was developed so far and to execute, to test, and to create new quantum algorithms the simulation of quantum computers on ...
Francisco Revson Fernandes Pereira +2 more
openaire +1 more source
Robustness of quantum Fourier transform interferometry [PDF]
Optics Letters, 2019 We analyse the effect of decoherence and noise on quantum Fourier transform interferometry, in which a boson sampling photonic network is used to measure optical phase gradients. This novel type of metrology is shown to be robust against phase decoherence.
Bogdan Opanchuk +2 more
exaly +5 more sources
2021
Let us recall the main definitions associated with the classical Fourier transform known from the course of mathematical analysis. The Fourier transform is one of the central methods of modern applied mathematics [1, 2]. Consider a function \(s:\mathbb {R}\rightarrow \mathbb {C}\). Let s(t) be absolutely integrable on its domain of definition, that is \
Sergei Kurgalin, Sergei Borzunov
openaire +1 more source
Let us recall the main definitions associated with the classical Fourier transform known from the course of mathematical analysis. The Fourier transform is one of the central methods of modern applied mathematics [1, 2]. Consider a function \(s:\mathbb {R}\rightarrow \mathbb {C}\). Let s(t) be absolutely integrable on its domain of definition, that is \
Sergei Kurgalin, Sergei Borzunov
openaire +1 more source
The multiplier based on quantum Fourier transform
CCF Transactions on High Performance Computing, 2020In the paper, we first present a quantum multiplier based on quantum Fourier transform (QFT), which is composed by a series of double-controlled phase gates, the control qubits are from the two multipliers, and the controlled qubits are in the ancillary state.
Anqi Zhang, Xuemei Wang, Shengmei Zhao
openaire +1 more source
2021
Quantum Fourier transform (QFT) plays a key role in many quantum algorithms, but the existing circuits of QFT are incomplete and lacking the proof of correctness. Furthermore, it is difficult to apply QFT to the concrete field of information processing.
openaire +1 more source
Quantum Fourier transform (QFT) plays a key role in many quantum algorithms, but the existing circuits of QFT are incomplete and lacking the proof of correctness. Furthermore, it is difficult to apply QFT to the concrete field of information processing.
openaire +1 more source
Fourier Transforms and Quantum Computation
2002The foundations of computer science are built upon the modified Church-Turing thesis. This thesis states that any reasonable model of computation can be simulated by a probabilistic Turing Machine with at most polynomial factor simulation overhead (see [10] for a discussion). Early interest in quantum computation from a computer science perspective was
openaire +2 more sources
Structural stability of the quantum Fourier transform
Quantum Information Processing, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yun Seong Nam, Reinhold Blümel
openaire +2 more sources
STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER
International Journal of Quantum Information, 2005We analyze the influence of errors on the implementation of the quantum Fourier transformation. Two kinds of errors are studied: (i) systematic errors due to off-resonant transitions and (ii) errors due to an external perturbation. The scaling of errors with system parameters and the number of qubits is analyzed.
Celardo, GL, Pineda, C, Znidaric, M
openaire +2 more sources