Related papers: Quantum algorithm for Feynman loop integrals
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here we present two algorithms that, in conjunction with other methods developed…
With small-scale quantum processors transitioning from experimental physics labs to industrial products, these processors allow us to efficiently compute important algorithms in various fields. In this paper, we propose a quantum algorithm…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
Recent demonstrations of superconducting quantum computers by Google and IBM and trapped-ion computers from IonQ fueled new research in quantum algorithms, compilation into quantum circuits, and empirical algorithmics. While online access…
We describe in detail the application of four qubit cluster states, built on the simultaneous entanglement of two photons in the degrees of freedom of polarization and linear momentum, for the realization of a complete set of basic one-way…
We present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the other two make use of quantum approximate counting, and all of…
The simplest technique for simulating a quantum algorithm - QA described based on the direct matrix representation of the quantum operators. Using this approach, it is relatively simple to simulate the operation of a QA and to perform…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
The variational quantum imaginary time evolution algorithm is efficient in finding the ground state of a quantum Hamiltonian. This algorithm involves solving a system of linear equations in a classical computer and the solution is then used…
Loading classical data into quantum computers represents an essential stage in many relevant quantum algorithms, especially in the field of quantum machine learning. Therefore, the inefficiency of this loading process means a major…
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the…
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing…
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…
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N \beta/{\cal Z}}$ and polynomial in…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling…
By carefully analyzing the relations between operator methods and the discretized and continuum path integral formulations of quantum-mechanical systems, we have found the correct Feynman rules for one-dimensional path integrals in curved…
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…