Related papers: Preparing angular momentum eigenstates using engin…
The efficient initialization of a quantum system is a prerequisite for quantum technological applications. Here we show that several classes of quantum states of a harmonic oscillator can be efficiently prepared by means of a…
We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions. Our method integrates variational quantum circuits with…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
This thesis investigates quantum algorithms for eigenstate preparation, with a focus on solving eigenvalue problems such as the Schrodinger equation by utilizing near-term quantum computing devices. These problems are ubiquitous in several…
We present an explicit quantum circuit that prepares an arbitrary $U(1)$-eigenstate on a quantum computer, including the exact eigenstates of the spin-1/2 XXZ quantum spin chain with either open or closed boundary conditions. The algorithm…
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons, which are otherwise difficult to…
Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the $SU(2)$ total-spin symmetry, remains a major challenge.…
We propose quantum algorithms for projective ground-state preparation and calculations of the many-body Green's functions directly in frequency domain. The algorithms are based on the linear combination of unitary (LCU) operations and…
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated…
Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to…
Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we consider the Grover-Rudolph algorithm, which has recently…
Quantum state preparation is vital in quantum computing and information processing. The ability to accurately and reliably prepare specific quantum states is essential for various applications. One of the promising applications of quantum…
For the preparation of high-dimensional functions on quantum computers, we introduce tensor network algorithms that are efficient with regard to dimensionality, optimize circuits composed of hardware-native gates and take gate errors into…
Quantum computers are a highly promising tool for efficiently simulating quantum many-body systems. The preparation of their eigenstates is of particular interest and can be addressed, e.g., by quantum phase estimation algorithms. The…
The ability to prepare states for quantum chemistry is a promising feature of quantum computers, and efficient techniques for chemical state preparation is an active area of research. In this paper, we implement and investigate two methods…
We propose a scheme enabling the universal coupling of angular momentum of $N$ remote noninteracting qubits using linear optical tools only. Our system consists of $N$ single-photon emitters in a $\Lambda$-configuration that are entangled…
We present a novel methodological framework for quantum spatial search, generalising the Childs & Goldstone ($\mathcal{CG}$) algorithm via alternating applications of marked-vertex phase shifts and continuous-time quantum walks. We…