Results 41 to 50 of about 2,036,649 (124)
Quantum self-learning Monte Carlo and quantum-inspired Fourier transform sampler
The self-learning metropolis-Hastings algorithm is a powerful Monte Carlo method that, with the help of machine learning, adaptively generates an easy-to-sample probability distribution for approximating a given hard-to-sample distribution.
Katsuhiro Endo +3 more
doaj +1 more source
On the spectral nature of entanglement
This study establishes, for the first time in literature, that quantum entanglement, as well as the most important protocol derived from it, that is, quantum teleportation, completely rest on the Quantum Fourier Transform.
Mario Mastriani
doaj +1 more source
Quantum Fourier transform is the building block for creating entanglement
This study demonstrates entanglement can be exclusively constituted by quantum Fourier transform (QFT) blocks. A bridge between entanglement and QFT will allow incorporating a spectral analysis to the already traditional temporal approach of entanglement,
Mario Mastriani
doaj +1 more source
Fourier-transform quantum state tomography [PDF]
7 pages, 4 figures, minor changes from ...
Mohammadi, Mohammadreza +2 more
openaire +2 more sources
Semiclassical Fourier Transform for Quantum Computation [PDF]
Latex 6 pages, two figures on one page in uuencoded ...
Griffiths, Robert B., Niu, Chi-Sheng
openaire +3 more sources
The quantum Fourier transform based on quantum vision representation [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hai-Sheng Li 0001 +4 more
openaire +3 more sources
Coherent light scattering from a telecom C-band quantum dot
Quantum networks have the potential to transform secure communication via quantum key distribution and enable novel concepts in distributed quantum computing and sensing.
L. Wells +5 more
doaj +1 more source
A Scalable Emulator for Quantum Fourier Transform Using Multiple-FPGAs With High-Bandwidth-Memory
Quantum computing is regarded as the future of computing that hopefully provides exponentially large processing power compared to the conventional digital computing.
Hasitha Muthumala Waidyasooriya +4 more
doaj +1 more source
Computing the fast Fourier transform on SIMD microprocessors [PDF]
This thesis describes how to compute the fast Fourier transform (FFT) of a power-of-two length signal on single-instruction, multiple-data (SIMD) microprocessors faster than or very close to the speed of state of the art libraries such as FFTW (“Fastest ...
Blake, Anthony Martin
core
Braided Groups and Quantum Fourier Transform
The present paper is a good example of a close interaction between different categorical constructions related with quantum groups. In a previous paper the first author built the Hopf algebra \(F\) in any \(k\)- linear abelian ribbon tensor category \(\mathcal C\), and motivated from physics and low-dimensional topology defined invertible operators \({\
Lyubashenko, V., Majid, S.
openaire +2 more sources

