Related papers: Quantum Wave Atom Transforms
Distinguishing between strings of data or waveforms is at the core of multiple applications in information technologies. In a quantum language the task is to design protocols to differentiate quantum states. Quantum-based technologies…
It has recently been shown that starting with a classical query algorithm (decision tree) and a guessing algorithm that tries to predict the query answers, we can design a quantum algorithm with query complexity $O(\sqrt{GT})$ where $T$ is…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
Wavelets offer significant advantages for the analysis of problems in quantum mechanics. Because wavelets are localized in both time and frequency they avoid certain subtle but potentially fatal conceptual errors that can result from the…
Existing parallel algorithms for wavelet tree construction have a work complexity of $O(n\log\sigma)$. This paper presents parallel algorithms for the problem with improved work complexity. Our first algorithm is based on parallel integer…
Using the convex structure of positive operator value measurements and of several quantities used in quantum metrology, such as quantum Fisher information or the quantum Van Trees information, we present an efficient numerical method to…
The area of trapping the atoms or molecules using light has advanced tremendously in the last few decades. In contrast, the idea of controlling (not only trapping) the movement of atomic-sized particles using quantum mechanical matter waves…
Quantum nuclear dynamics with wavepacket time-evolution is classically intractable and viewed as a promising avenue for quantum information processing. Here, we use an IonQ 11-qubit trapped-ion quantum computer, Harmony, to study the…
Variational Quantum Algorithms are among the most promising systems to implement quantum computing under the Noisy-Intermediate Scale Quantum (NISQ) technology. In variational quantum algorithm, wavefunction represented by a parametrized…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
Partial differential equations (PDEs) are fundamental across numerous scientific fields. As these problems scale to high dimensions, classical numerical schemes introduce severe computational bottlenecks, known as the curse of…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can only be applied to small systems. By contrast, we demonstrate that quantum…
Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow…
Creating quantum algorithms is a difficult task, especially for computer scientist not used to quantum computing. But quantum algorithms often use similar elements. Thus, these elements provide proven solutions to recurring problems, i.e. a…
Despite the promise that fault-tolerant quantum computers can efficiently solve classically intractable problems, it remains a major challenge to find quantum algorithms that may reach computational advantage in the present era of noisy,…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
The quantum shutter approach to tunneling time scales (G. Garc\'{\i }a-Calder\'{o}n and A. Rubio, Phys. Rev. A \textbf{55}, 3361 (1997)), which uses a cutoff plane wave as the initial condition, is extended in such a way that a certain type…
Quantum algorithm involves the manipulation of amplitudes and computational basis, of which manipulating basis is largely a quantum analogue of classical computing that is always a major contributor to the complexity. In order to make full…
The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical…