Approximately preparing an N-fold rotationally symmetric cat state with the phase space instruction set requires circuit depth Omega(phi(N)) = Omega(N / log log N), and for prime N a depth-4N protocol saturates this bound with optimal runtime Theta(alpha).
Generalized Parity Measurements and Efficient Large Multi-component Cat State Preparation with Quantum Signal Processing
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Generalized parity measurements are instrumental for the preparation of non-trivial quantum states and the detection of errors in error correction codes. Here, we detail a proposal for efficient and robust generalized parity measurements based on Quantum Signal Processing. Most strikingly, given access to an evolution generated by a one-to-all coupling interaction Hamiltonian between a measurement qubit and the measured system, the desired measurement can be implemented in constant time determined only by the interaction rate. The proposed generalized parity measurement can be used to efficiently prepare high-fidelity multi-component cat states in the setting of superconducting cavity quantum electrodynamics. We benchmark the state-preparation protocol through numerical simulations with realistic system parameters. We show that a 20-component cat state with $400$ photons can be prepared with success probability $>2\%$ and a fidelity $\approx 90\%$ limited by the cavity decay and nonlinear qubit-cavity coupling rates. Our results pave the way for the realization of a wide range of useful non-classical states consisting of a large number of excitations.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Preparing approximate $N$-fold cat states with the phase space instruction set
Approximately preparing an N-fold rotationally symmetric cat state with the phase space instruction set requires circuit depth Omega(phi(N)) = Omega(N / log log N), and for prime N a depth-4N protocol saturates this bound with optimal runtime Theta(alpha).