Related papers: Deterministic Bethe state preparation
Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. The shallowest circuit depth needed to prepare Slater…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
We explicitly construct a quantum circuit which exactly generates random three-qubit states. The optimal circuit consists of three CNOT gates and fifteen single qubit elementary rotations, parametrized by fourteen independent angles. The…
We propose a scheme to construct a deterministic CNOT gate on static electron-spin qubits, allowing for deterministic scalable quantum computing in solid-state systems.The excess electron confined in a charged quantum dot inside a…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
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 variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
We propose a method for constructing $\texttt{PREPARE}$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry by using variational optimization of quantum circuits solely on classical computers. The…
We consider a system of two spins that are coupled via an isotropic Heisenberg Hamiltonian. For the first time, a two-step method for the preparation of an arbitrary quantum state of two qubits in the form of the Schmidt decomposition is…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific…
A novel Bethe Ansatz scheme is proposed to calculate physical properties of quantum integrable systems without $U(1)$ symmetry. As an example, the anti-periodic XXZ spin chain, a typical correlated many-body system embedded in a topological…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
We propose a deterministic remote state preparation (RSP) scheme for preparing an arbitrary (including pure and mixed) qubit, where a partially entangled state and finite classical communication are used. To our knowledge, our scheme is the…
The class of two-qubit Bell-diagonal states has been the workhorse for developing understanding about the geometry, dynamics, and applications of quantum resources. In this article, we present a quantum circuit for preparing Bell-diagonal…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
A method of switching a controlled-NOT gate in a solid-stae NMR quantum computer is presented. Qubits of I=1/2 nuclear spins are placed periodically along a quantum spin chain (1-D antiferromagnet) having a singlet ground state with a…