Logarithmic-Depth Quantum Circuits for Hamming Weight Projections

Abstract

A pure state of fixed Hamming weight is a superposition of computational basis states such that each bitstring in the superposition has the same number of ones. Given a Hilbert space of the form $\mathcal{H}=({\mathbb{C}}_2{)}^{\otimes n}$, or an $n$-qubit system, the identity operator can be decomposed as a sum of projectors onto subspaces of fixed Hamming weight. In this work, we propose several quantum algorithms that realize a coherent Hamming weight projective measurement on an input pure state, meaning that the post-measurement state of the algorithm is the projection of the input state onto the corresponding subspace of fixed Hamming weight. We analyze a depth-width trade-off for the corresponding quantum circuits, allowing for a depth reduction of the circuits at the cost of more control qubits. For an $n$-qubit input, the depth-optimal algorithm uses $O(n)$ control qubits and the corresponding circuit has depth $O(\log (n))$, assuming that we have the ability to perform qubit resets. Furthermore, the proposed algorithm construction uses only one- and two-qubit gates.

17 pages, 14 figures; see independent and concurrent work of Zi, Nie, Sun at arXiv:2404.06052 and Piroli, Styliaris, Cirac at arXiv:2403.07604. Accepted for publication in Physical Review A

References in corpus (13)

• Operational Resource Theory of Coherence
• From Classical to Quantum Shannon Theory
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Pretending to factor large numbers on a quantum computer
• Quantum Circuits with Unbounded Fan-out
• Efficient compression of quantum information
• Quantum Algorithmic Readout in Multi-Ion Clocks
• Multivariate trace estimation in constant quantum depth
• Avoiding coherent errors with rotated concatenated stabilizer codes
• Quantum Networks for Concentrating Entanglement
• Testing symmetry on quantum computers
• Entanglement of two non-interacting qubits via a mesoscopic system
• Multicasting Homogeneous and Heterogeneous Quantum States in Quantum Networks

Cited by in corpus (2)

• Efficient preparation of Dicke states
• Hardness of observing strong-to-weak symmetry breaking