相关论文: Comment on "Quantum waveguide array generator for …
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
The following is the body of page ix of the PhD thesis Quantum Trajectories and Feedback by H.M. Wiseman (Physics Department, University of Queensland, 1994), which is downloadable as a postscript file at…
A method for the analysis of the power pattern of phased array antennas (PAs) based on the quantum Fourier transform (QFT) is proposed. The computation of the power pattern given the set of complex excitations of the PA elements is…
Comment on paper by A. Zvyagin, Phys. Rev. B 64, R060405 (2001).
In [A.W. Harrow and R.A. Low, Commun. Math. Phys. 291, 257-302 (2009)], it was shown that a quantum circuit composed of random 2-qubit gates converges to an approximate quantum 2-design in polynomial time. We point out and correct a flaw in…
We argue that our analysis of the J-Q model, presented in Phys. Rev. B 80, 174403 (2009), and based on a field-theory description of coupled dimers, captures properly the strong quantum fluctuations tendencies, and the objections outlined…
This is about the paper by Thawhat Changphas and Nawamin Phaipong in Quasigroups and Related Systems 22 (2014), 193--200.
This comment points out that the recent paper by Maki and Haas [Phys. Rev. B {\bf 67}, 020510 (2003)] is completely wrong.
In the paper by Hasegawa, Hagino and Tanimura (HHT) [Phys. Lett. B 808 (2020) 135693, arXiv:2006.06944], they concluded that quantum tunneling was simulated by a time-dependent generator coordinate method (TDGCM). In contrast, difficulties…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
Prepared for the Quantum Field Theory section of the Encyclopedia of Mathematical Physics, Elsevier, 2006. A brief introduction to the methodology and techniques of perturbative relativistic quantum field theory is presented.
This Ph.D. thesis provides a comprehensive review of the state-of-the-art in the field of Variational Quantum Algorithms and Quantum Machine Learning, including numerous original contributions. The first chapters are devoted to a brief…
As an alternative but unified and more fundamental description for quantum physics, Feynman path integrals generalize the classical action principle to a probabilistic perspective, under which the physical observables' estimation translates…
We reply to Comment by J. Gemmer, L. Knipschild, R. Steinigeweg (arXiv:1712.02128) on our paper Phys. Rev. Lett. 119, 100601 (2017).
A reply to the comment by V. R. Shaginyan et al. [Phys. Rev. Lett. 107, 279701 (2011), arXiv:1206.5372] on our article [Phys. Rev. Lett. 106, 137002 (2011), arXiv:1012.0303].
I compiled a list of articles on arXiv that deal with possible fundamental quantum nonlinearities or examine the origins of its linearity. The list extends til August 2004.
These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states…
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits…
This is a reply to the comment by A. W. Sandvik (cond-mat/0010433) on our paper Phys. Rev. Lett. 84, 4204 (2000). We show that his data do not conflict with our data nor with our conclusions.
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…