Deterministic Preparation of Dicke States

04/15/2019
by   Andreas Bärtschi, et al.
0

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.

READ FULL TEXT
research
07/20/2022

Short-Depth Circuits for Dicke State Preparation

We present short-depth circuits to deterministically prepare any Dicke s...
research
10/25/2021

SWAP Test for an Arbitrary Number of Quantum States

We develop a recursive algorithm to generalize the quantum SWAP test for...
research
03/01/2022

Optimal quantum dataset for learning a unitary transformation

Unitary transformations formulate the time evolution of quantum states. ...
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
04/10/2019

Optimality in Quantum Data Compression using Dynamical Entropy

In this article we study lossless compression of strings of pure quantum...
research
08/30/2022

Symmetric Pruning in Quantum Neural Networks

Many fundamental properties of a quantum system are captured by its Hami...

Please sign up or login with your details

Forgot password? Click here to reset