Related papers: Logarithmic-depth quantum state preparation of pol…
Quantum state preparation involving a uniform superposition over a non-empty subset of $n$-qubit computational basis states is an important and challenging step in many quantum computation algorithms and applications. In this work, we…
Quantum state preparation plays an equally important role with quantum operations and measurements in quantum information processing. The previous methods of preparing initial state for bulk quantum computation all have inevitable…
We describe the encoding of multiple qubits per atom in trapped atom quantum processors and methods for performing both intra- and inter-atomic gates on participant qubits without disturbing the spectator qubits stored in the same atoms. We…
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…
Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding…
The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane wave representation are especially…
Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm…
The optimization of quantum circuit depth is crucial for practical quantum computing, as limited coherence times and error-prone operations constrain executable algorithms. Measurement and feedback operations are fundamental in quantum…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
In Ref. [Phys. Rev. A 100, 062317 (2019)], the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems…
We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We…
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
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…
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…
Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid…
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…
Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gates. Reducing the number of CNOT gates can lead to more…
The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…
An alternative quantum algorithm for the discrete logarithm problem is presented. The algorithm uses two quantum registers and two Fourier transforms whereas Shor's algorithm requires three registers and four Fourier transforms. A crucial…