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

Birkhäuser Boston eBooks

Quantum Spectral Transform

P. P. Kulish

Published Jan 1, 1985• 3 citations
Publisher

Abstract

The Quantum Inverse Problem Method (or Quantum Spectral Transform) was invented at the end of 1978/beginning of 1979. During these five years there has been a remarkable development of this method with many papers on QST published (cf. reviews [3–5, 10, 17, 28]) and many results obtained. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI
10.1007/978-1-4899-6650-6_14

Related papers

A quantum Fourier transform algorithm

Chris Lomont

Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits needed to achieve a desired tolerance, allowing simulation of the algorithm.

arXiv:quant-ph/0404060•Apr 9, 2004•3 citations

Lecture 11: Time Independent Formalisms. Flux-Across Surfaces. Enss Method. Inverse Scattering

Gianfausto Dell’Antonio

At the beginning of Lecture 10 we have remarked that scattering Theory in Quantum as in Classical Mechanics, describes those effects of the interaction of a system of N particles which can be measured when the components of the system have become spatially separated so that the mutual interactions have become negligible. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Atlantis studies in mathematical physics•Jan 1, 2016•0 citations

Quantum Tomography Via Group Theory

M. Paini

Amongst the multitude of state reconstruction techniques, the so-called "quantum tomography" seems to be the most fruitful. In this letter, I will start by developing the mathematical apparatus of quantum tomography and, later, I will explain how it can be applied to various quantum systems.

arXiv:quant-ph/0002078•Feb 25, 2000•1 citation

A Survey oh Wigner-Poisson Problems

Horst Lange, B. Toomire, Paul F. Zweifel

In 1932, E.Wigner [1] introduced a phase-space method of computing physical observables in quantum (statistical) mechanics; some surveys have been published recently [2], [3]. See also a review article by Carruthers [4]. Here we give a brief synopsis of the method to make this paper self-contained, referring the reader to the references for details, including proofs. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Operator theory•Jan 1, 1994•1 citation

Quantum Fourier Operators and Their Application

Eric Sakk

The application of the quantum Fourier transform (QFT) within the field of quantum computation has been manifold. Shor’s algorithm, phase estimation and computing discrete logarithms are but a few classic examples of its use. These initial blueprints for quantum algorithms have sparked a cascade of tantalizing solutions to problems considered to be intractable on a classical computer. Therefore, two main threads of research have unfolded. First, novel applications and algorithms involving the QFT are continually being developed. Second, improvements in the algorithmic complexity of the QFT are also a sought after commodity. In this work, we review the structure of the QFT and its implementation. In order to put these concepts in their proper perspective, we provide a brief overview of quantum computation. Finally, we provide a permutation structure for putting the QFT within the context of universal computation.

IntechOpen eBooks•Jan 25, 2021•3 citations

EPR

David Wick

The third round of the Bohr-Einstein debate was conducted by way of the journals rather than in person. Five years after Bohr’s victory at the Sixth Solvay Conference, Einstein, working with two younger colleagues, Boris Podolsky and Nathan Rosen, finally achieved a sharp formulation of the argument that quantum mechanics is an incomplete description of reality. They published in the American journal The Physical Review , in 1935. As one expects in a paper bearing Einstein’s name, the argument is simple but very clever. An improvement by Schrödinger speeds up the exposition. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Boston eBooks•Jan 1, 1995•0 citations
The Quantum Inverse Problem Method (or Quantum Spectral Transform) was invented at the end of 1978/beginning of 1979. During these five years there has been a remarkable development of this method with many papers on QST published (cf. reviews [3–5, 10, 17, 28]) and many results obtained. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
In 1932, E.Wigner [1] introduced a phase-space method of computing physical observables in quantum (statistical) mechanics; some surveys have been published recently [2], [3]. See also a review article by Carruthers [4]. Here we give a brief synopsis of the method to make this paper self-contained, referring the reader to the references for details, including proofs. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The application of the quantum Fourier transform (QFT) within the field of quantum computation has been manifold. Shor’s algorithm, phase estimation and computing discrete logarithms are but a few classic examples of its use. These initial blueprints for quantum algorithms have sparked a cascade of tantalizing solutions to problems considered to be intractable on a classical computer. Therefore, two main threads of research have unfolded. First, novel applications and algorithms involving the QFT are continually being developed. Second, improvements in the algorithmic complexity of the QFT are also a sought after commodity. In this work, we review the structure of the QFT and its implementation. In order to put these concepts in their proper perspective, we provide a brief overview of quantum computation. Finally, we provide a permutation structure for putting the QFT within the context of universal computation.
The third round of the Bohr-Einstein debate was conducted by way of the journals rather than in person. Five years after Bohr’s victory at the Sixth Solvay Conference, Einstein, working with two younger colleagues, Boris Podolsky and Nathan Rosen, finally achieved a sharp formulation of the argument that quantum mechanics is an incomplete description of reality. They published in the American journal The Physical Review , in 1935. As one expects in a paper bearing Einstein’s name, the argument is simple but very clever. An improvement by Schrödinger speeds up the exposition. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.