Related papers: Quantum Fourier Transform Has Small Entanglement
There are important algorithms built upon a mixture of basic techniques described; for example, the Fast Fourier Transform (FFT) employs both Divide-and-Conquer and Transform-and-Conquer techniques. In this article, the evolution of a…
In this study, we present a technique based on the quantum Fourier transform (QFT) that allows the generation of disjoint sets of entangled particles, in such a way that particles of the same set are entangled with each other, while…
A noteworthy discovery is that the minimal evolution time is smaller for parity-time ($\mathcal{PT}$) symmetric systems compared to Hermitian setups. Moreover, there is a significant acceleration of two-qubit quantum entanglement…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
Quantum entanglement is the central resource behind applications in quantum information science, from quantum computers and simulators of complex quantum systems to metrology and secure communication. All of these applications require the…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…
The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block…
Entanglement is a key property in the development of quantum technologies and in the study of quantum many-body simulations. However, entanglement measurement typically requires quantum full-state tomography (FST). Here we present a neural…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
Quantum algorithms allow to outperform their classical counterparts in various tasks, most prominent example being Shor's algorithm for efficient prime factorization on a quantum computer. It is clear that one of the reasons for the speedup…
We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with…
The Special Affine Fourier Transform or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Unlike the Fourier transform, the SAFT does not work well…
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known,…
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as…
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…
Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in…
In computational molecular science, calculation of electrostatic interactions involving charged atoms - the strongest interactions in condensed phases, is a major bottleneck. We propose a quantum-classical algorithm for fast, yet, accurate…
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for…