Related papers: Efficient preparation of Dicke states
We explore the usefulness of mid-circuit measurements to enhance quantum algorithmics. Specifically, we assess how quantum phase estimation (QPE) and mid-circuit measurements can improve the performance of variational quantum algorithms.…
Preparing large-qubit Dicke states is of broad interest in quantum computing and quantum metrology. However, the number of qubits available on a single quantum processing unit (QPU) is limited -- motivating the distributed preparation of…
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
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 to verify the metrological usefulness of noisy Dicke states of a particle ensemble with only a few collective measurements, without the need for a direct measurement of the sensitivity. Our method determines the…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit composed of global one-axis twisting and global rotations to…
We propose to employ the amplification mechanism of Grover's search algorithm to efficiently prepare entangled states of an ensemble of qubits. The conditional change of sign employed in the algorithm can be implemented by the phase shift…
The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|\psi_v\rangle =\sum_{k=0}^{2^n-1}v_k|k\rangle$ from the initial state $|0\rangle^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\ldots,v_{2^n-1})^T\in…
There has been an extensive development in the use of multi-partite entanglement as a resource for various quantum information processing tasks. In this paper we focus on preparing arbitrary spin eigenstates whose subset contain important…
Recently, the technique of counterdiabatic driving, which provides an effective strategy for accelerating adiabatic quantum evolution, has been widely applied in the preparation of many-body quantum states. In this work, we propose a…
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear systems…
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…
We present a deterministic protocol for the preparation of entangled states in the symmetric Dicke subspace of $N$ spins coupled to a common cavity mode that prepares entangled states useful for quantum sensing, achieving a precision…
An energy gap develops near quantum critical point of quantum phase transition in a finite many-body (MB) system, facilitating the ground state transformation by adiabatic parameter change. In real application scenarios, however, the…
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it…
Reducing circuit depth and identifying an optimal trade-off between circuit depth and width is crucial for successful quantum computation. In this context, midcircuit measurement and feedforward have been shown to significantly reduce the…
We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an $N$-dimensional state in depth $O(\log(N))$ and spacetime allocation (a…