REVIEW 4 cited by
Deterministic Preparation of Dicke States
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Deterministic Preparation of Dicke States
read the original abstract
The Dicke state $|D_k^n\rangle$ 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.
Forward citations
Cited by 4 Pith papers
-
Magic-protected entanglement and Clifford-irreducible structure in magic state space
Quantum states are classified by how much bipartite entanglement survives optimal simplification by classically easy Clifford operations, yielding a split into weakly protected T-magic and strongly protected W-magic regimes.
-
Protecting Astronomical Interferometry through Quantum-Memory Scrambling
A depth-2, five-cell number-conserving encoder with pattern-conditioned recovery beats deeper and charge-Haar benchmarks at one operating point under all-pattern flagged erasure, with no throughput advantage claimed.
-
Spin-$s$ $U(1)$-eigenstate preparation
A Gray-code-based quantum circuit prepares arbitrary fixed-digit-sum (U(1)) eigenstates of spin-s chains, yielding the first preparation of spin-s XXX Bethe states.
-
Clifford Orbits from Cayley Graph Quotients
Quotienting the Cayley graph of the Clifford group by a quantum state's stabilizer subgroup produces a graph of the state's Clifford orbit.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.