Short-Depth Circuits for Dicke State Preparation

07/20/2022
by   Andreas Bärtschi, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Deterministic Preparation of Dicke States

The Dicke state |D_k^n〉 is an equal-weight superposition of all n-qubit ...
research
12/23/2021

A Divide-and-Conquer Approach to Dicke State Preparation

We present a divide-and-conquer approach to deterministically prepare Di...
research
11/20/2017

On the Geometry of Stabilizer States

Large-scale quantum computation is likely to require massive quantum err...
research
02/21/2019

On the qubit routing problem

We introduce a new architecture-agnostic methodology for mapping abstrac...
research
05/09/2020

Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions

Effective quantum computation relies upon making good use of the exponen...
research
03/03/2023

Spacetime-Efficient Low-Depth Quantum State Preparation with Applications

We propose a novel deterministic method for preparing arbitrary quantum ...
research
07/13/2022

Recursive Methods for Synthesizing Permutations on Limited-Connectivity Quantum Computers

We describe a family of recursive methods for the synthesis of qubit per...

Please sign up or login with your details

Forgot password? Click here to reset