Short-Depth Circuits for Dicke State Preparation
arXiv:2207.09998 · doi:10.1109/QCE53715.2022.00027
Abstract
We present short-depth circuits to deterministically prepare any Dicke state |Dn,k>, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of entangled quantum states with a large variety of applications, and a long history of experimental creation in physical systems. On the other hand, not much is known regarding efficient scalable quantum circuits for Dicke state preparation on realistic quantum computing hardware connectivities. Here we present preparation circuits for Dicke states |Dn,k> with (i) a depth of O(k log(n/k)) for All-to-All connectivity (such as on current ion trap devices); (ii) a depth of O(k sqrt(n/k)) = O(sqrt(nk) for Grid connectivity on grids of size Omega(sqrt(n/s)) x O(sqrt(ns)) with s<=k (such as on current superconducting qubit devices). Both approaches have a total gate count of O(kn), need no ancilla qubits, and generalize to both the preparation and compression of symmetric pure states in which all non-zero amplitudes correspond to states with Hamming weight at most k. Thus our work significantly improves and expands previous state-of-the art circuits which had depth O(n) on a Linear Nearest Neighbor connectivity for arbitrary k (Fundamentals of Computation Theory 2019) and depth O(log n) on All-to-All connectivity for k=1 (Advanced Quantum Technologies 2019).
arXiv commentIEEE International Conference on Quantum Computing and Engineering, QCE'22, to appear, 2022
References in corpus (29)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Multipartite entanglement and high precision metrology
- Experimental realization of Dicke states of up to six qubits for multiparty quantum networking
- Experimental entanglement of a six-photon symmetric Dicke state
- -mixers: analytical and numerical results for QAOA
- Topological and subsystem codes on low-degree graphs with flag qubits
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- Dynamically Generated Logical Qubits
- Deterministic Dicke state preparation with continuous measurement and control
- Efficient quantum algorithms for and states, and implementation on the IBM quantum computer
- Deterministic Preparation of Dicke States
- Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
- Permutation-invariant quantum codes
- Preparation of Dicke States in an Ion Chain
- A necessary and sufficient condition to play games in quantum mechanical settings
- The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
- Boundaries for the Honeycomb Code
- A Divide-and-Conquer Approach to Dicke State Preparation
- Efficient compression of quantum information
- Quantum storage in quantum ferromagnets
- Permutation-invariant quantum coding for quantum deletion channels
- Geometric pathway to scalable quantum sensing
- Creation of arbitrary Dicke and NOON states of trapped-ion qubits by global addressing with composite pulses
- Deterministic generation of arbitrary symmetric states and entanglement classes
- Threshold-Based Quantum Optimization
- Lower bounds for the fidelity of entangled state preparation
Cited by in corpus (28)
- Speed limits and locality in many-body quantum dynamics
- A Divide-and-Conquer Approach to Dicke State Preparation
- Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
- Constrained Optimization via Quantum Zeno Dynamics
- State preparation by shallow circuits using feed forward
- Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
- Provable bounds for noise-free expectation values computed from noisy samples
- Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States
- Optimization by Decoded Quantum Interferometry
- Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations
- -analog qudit Dicke states
- Quantum Speedup of the Dispersion and Codebook Design Problems
- JuliQAOA: Fast, Flexible QAOA Simulation
- Efficient preparation of Dicke states
- Spin-s Dicke states and their preparation
- Symmetric quantum states: a review of recent progress
- Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
- Probing Quantum Telecloning on Superconducting Quantum Processors
- Efficient preparation of entangled states in cavity QED with Grover's algorithm
- Quantum Telecloning on NISQ Computers
- Hardware-Efficient Preparation of Graph States on Near-Term Quantum Computers
- Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones
- Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent
- Efficient Sparse State Preparation via Quantum Walks
- Globally optimal interferometry with lossy twin Fock probes
- Quantum Circuit Design for Decoded Quantum Interferometry
- Electric Power Demand Portfolio Optimization by Fermionic QAOA with Self-Consistent Local Field Modulation
- Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz