Related papers: Efficient preparation of Dicke states
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…
Compared to general quantum states, the sparse states arise more frequently in the field of quantum computation. In this work, we consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two…
We propose an experimentally accessible procedure for conditional preparation of highly non-classical states of collective spin of an atomic ensemble. The quantum state engineering is based on a combination of QND interaction between atoms…
We characterize the long-time projective behavior of the stochastic master equation describing a continuous, collective spin measurement of an atomic ensemble both analytically and numerically. By adding state based feedback, we show that…
Quantum state preparation is a fundamental and significant subroutine in quantum computing. In this paper, we conduct a systematic investigation on the circuit size (the total count of elementary gates in the circuit) for sparse quantum…
Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known…
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…
Long-range entangled quantum states -- like cat states and topological order -- are key for quantum metrology and information purposes, but they cannot be prepared by any scalable unitary process. Intriguingly, using measurements as an…
Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous…
The deterministic preparation of quantum many-body ground states is essential for advanced quantum simulation, yet optimal algorithms often require prohibitive hardware resources. Here, we propose a highly efficient, non-variational…
Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with fewer two-qubit gates enhances accuracy and alleviates…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…
We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper…
We investigate the quantum non-demolition (QND) measurement of an atomic population based on a heterodyne detection and show that the induced back-action allows to prepare both spin-squeezed and Dicke states. We use a wavevector formalism…
Dicke states are completely symmetric states of multiple qubits (2-level systems), and qudit Dicke states are their $d$-level generalization. We define here $q$-deformed qudit Dicke states using the quantum algebra $su_q(d)$. We show that…
We have investigated theoretically and experimentally a method for preparing Dicke states in trapped atomic ions. We consider a linear chain of $N$ ion qubits that is prepared in a particular Fock state of motion, $|m>$. The $m$ phonons are…
We present a classical algorithm that, for any $D$-dimensional geometrically-local, quantum circuit $C$ of polylogarithmic-depth, and any bit string $x \in {0,1}^n$, can compute the quantity $|<x|C|0^{\otimes n}>|^2$ to within any…
We show that the quantum dimer state on the Kagome lattice, which was recently realized with high fidelity in a Rydberg quantum simulator [Semeghini et al., Science 374, 6572 (2021)], offers a sufficient resource for universal…
Quantum state preparation is an important ingredient for other higher-level quantum algorithms, such as Hamiltonian simulation, or for loading distributions into a quantum device to be used e.g. in the context of optimization tasks such as…
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence…