Deterministic Preparation of Dicke States

Abstract

The Dicke state $|D_k^n⟩$ is an equal-weight superposition of all $n$-qubit states with Hamming Weight $k$ (i.e. all strings of length $n$ with exactly $k$ ones over a binary alphabet). Dicke states are an important class of entangled quantum states that among other things serve as starting states for combinatorial optimization quantum algorithms. We present a deterministic quantum algorithm for the preparation of Dicke states. Implemented as a quantum circuit, our scheme uses $O(kn)$ gates, has depth $O(n)$ and needs no ancilla qubits. The inductive nature of our approach allows for linear-depth preparation of arbitrary symmetric pure states and -- used in reverse -- yields a quasilinear-depth circuit for efficient compression of quantum information in the form of symmetric pure states, improving on existing work requiring quadratic depth. All of these properties even hold for Linear Nearest Neighbor architectures.

References in corpus (24)

• Elementary gates for quantum computation
• Three qubits can be entangled in two inequivalent ways
• A Quantum Approximate Optimization Algorithm
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Synthesis of Quantum Logic Circuits
• 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
• Experimental Observation of Four-Photon Entangled Dicke State with High Fidelity
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Deterministic Dicke state preparation with continuous measurement and control
• Deterministic Preparation of Dicke States
• Preparation of Dicke States in an Ion Chain
• Operational determination of multi-qubit entanglement classes via tuning of local operations
• Quantum Data Compression of a Qubit Ensemble
• A necessary and sufficient condition to play games in quantum mechanical settings
• Efficient compression of quantum information
• Generalized parity measurements
• 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
• Quantum Networks for Generating Arbitrary Quantum States
• Finding cliques by quantum adiabatic evolution
• All bipartitions of arbitrary Dicke states
• Efficient quantum algorithm to construct arbitrary Dicke states

Cited by in corpus (71)

• Noise Resilience of Variational Quantum Compiling
• Variational Quantum State Eigensolver
• Deterministic Preparation of Dicke States
• Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Fast multi-qubit gates through simultaneous two-qubit gates
• A Divide-and-Conquer Approach to Dicke State Preparation
• Short-Depth Circuits for Dicke State Preparation
• Quantum algorithm for persistent Betti numbers and topological data analysis
• Preparing Bethe Ansatz Eigenstates on a Quantum Computer
• State preparation by shallow circuits using feed forward
• Efficient classical algorithms for simulating symmetric quantum systems
• Preparing Dicke states in a spin ensemble using phase estimation
• Preparing exact eigenstates of the open XXZ chain on a quantum computer
• Permutation-invariant quantum coding for quantum deletion channels
• Universal programmable photonic architecture for quantum information processing
• Entanglement in highly symmetric multipartite quantum states
• Threshold-Based Quantum Optimization
• Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Data re-uploading with a single qudit
• Interplay between transport and quantum coherences in free fermionic systems
• Quantum circuits for the preparation of spin eigenfunctions on quantum computers
• Finding Small and Large k-Clique Instances on a Quantum Computer
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Deterministic Bethe state preparation
• Parity Quantum Optimization: Encoding Constraints
• Anonymous quantum sensing
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• $q$-analog qudit Dicke states
• Exploring Light-Cone Distribution Amplitudes from Quantum Computing
• Optimizing Initial State of Detector Sensors in Quantum Sensor Networks
• Quantum Speedup of the Dispersion and Codebook Design Problems
• State preparation of AGP on a quantum computer without number projection
• JuliQAOA: Fast, Flexible QAOA Simulation
• Efficient preparation of Dicke states
• The fastest generation of multipartite entanglement with natural interactions
• Spin-s Dicke states and their preparation
• Universal Control of Symmetric States Using Spin Squeezing
• 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
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• Symmetric quantum states: a review of recent progress
• Quantum Telecloning on NISQ Computers
• On Actual Preparation of Dicke State on a Quantum Computer
• Succinct quantum testers for closeness and $k$-wise uniformity of probability distributions
• Quantum Electrodynamics of Dicke States: Resonant One-Photon Exchange and Entangled Decay Rate
• Quantum State Preparation Using an Exact CNOT Synthesis Formulation
• Hardware-Efficient Preparation of Graph States on Near-Term Quantum Computers
• Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians
• Quantum JPEG
• Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones
• Hybrid spin-phonon architecture for scalable solid-state quantum nodes
• Dicke subsystems are entangled
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Efficient Sparse State Preparation via Quantum Walks
• Scalable Experimental Bounds for Entangled Quantum State Fidelities
• Robust Quantum Circuit for Clique Problem with Intermediate Qudits
• End-to-End Quantum Algorithm for Topology Optimization in Structural Mechanics
• Quantum Circuit Design for Decoded Quantum Interferometry
• Simple ways of preparing qudit Dicke states
• Optimizing quantum codes with an application to the loss channel with partial erasure information
• QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers
• Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz
• Grover Adaptive Search with Spin Variables
• An Optimum Algorithm for Quantum Search
• Spin-$s$ $U(1)$-eigenstate preparation
• Towards violations of Local Friendliness with quantum computers