Exact Fock-State Preparation with $n^{1/4}$ Circuit Depth

Technical Summary: Exact Fock-State Preparation with $n^{1/4}$ Circuit Depth

Problem Statement
The preparation of large Fock states (high photon number states $|n\rangle$) in bosonic systems is a critical bottleneck for scaling quantum technologies, including quantum computation, communication, metrology, and sensing. While significant progress has been made in cavity and circuit QED, trapped ions, and optical platforms, preparing states with macroscopic occupation ($n \gg 100$) remains challenging. Existing approaches face specific limitations:

• Postselected methods suffer from rapidly decreasing success probabilities as $n$ increases.
• Deterministic schemes often sacrifice fidelity or require control complexity that scales poorly with the Hilbert-space dimension.
• Universal optimal-control methods typically demand long pulse sequences and numerical optimization, where complexity grows rapidly with photon number.
• Environmental coupling induces an effective decay rate that scales linearly with occupation, necessitating preparation speeds that increase (sublinearly) with $n$ rather than merely improving accuracy.

Current experimental limits are generally restricted to $\lesssim 100$ photons, motivating the need for analytical protocols with sublinear runtime, modest control requirements, and experimentally simple operations.

Methodology: The Deterministic One-Parameter (D1p) Protocol
The author introduces the Deterministic One-Parameter (D1p) protocol, which maps the dynamics of Fock-state preparation in an infinite-dimensional Hilbert space onto a two-dimensional invariant subspace. This approach reframes the problem as a Grover-search (amplitude amplification) task rather than a requirement for independent control of every populated Fock level.

1. Amplitude Amplification Framework:
   The protocol utilizes two generalized phase rotation operators:

   • Oracle ($S_o$): Applies a phase kick to the target state $|\psi_t\rangle = |n\rangle$.
   • Diffusion ($S_r$): Rotates the state about the axis defined by the initial state $|\psi_0\rangle$.
     Unlike conventional Grover search which often uses fixed-angle reflections ($\phi = \pi$) that may undershoot or overshoot the target, the D1p protocol employs a deterministic phase-matching prescription. Both the oracle and diffusion operators use a single matched phase parameter $\theta$, determined in closed form for any target $n$ and initial overlap $\lambda$.

2. Initial State and Overlap:
   The protocol starts with a coherent state $|\alpha\rangle$ generated via displacement $D(\alpha)$ from the vacuum. The target overlap is $\lambda = |\langle n | \alpha \rangle|^2$.

   • To minimize circuit depth, the initial coherent amplitude is optimized to $|\alpha| \simeq \sqrt{n}$.
   • Under this condition, the maximum overlap scales as $\lambda_{\text{max}} \approx 1/\sqrt{2\pi n}$, which decreases only as $n^{-1/2}$ rather than exponentially.

3. Circuit Construction:
   The protocol requires only native bosonic controls:

   • Displacements ($D(\alpha)$): To prepare the initial coherent state and map the diffusion operator.
   • Number-Selective Phase Kicks ($S_n(\theta)$): A SNAP gate acting on the target level $|n\rangle$.
     The diffusion operator is implemented as $S_r(\theta) = D(\alpha) S_0(\theta) D^\dagger(\alpha)$, effectively applying a phase kick to the vacuum in the displaced frame.

Key Results

• Sublinear Scaling: The optimal number of iterations $k_{\text{opt}}$ required to reach unit fidelity scales as $O(n^{1/4})$. Specifically, $k_{\text{opt}} \approx \lceil \frac{\pi}{4}(2\pi n)^{1/4} - \frac{1}{2} \rceil$.
• Efficiency: For a target of $|10^6\rangle$, the protocol requires only 39 iterations. If individual gate durations are independent of $n$, the total preparation time inherits this $O(n^{1/4})$ scaling.
• Unit Fidelity: In the ideal model, phase matching guarantees unit fidelity, avoiding the oscillatory "overshoot" issues of fixed-phase variants.
• Robustness: The protocol is first-order insensitive to small errors in the initial amplitude $\alpha$ and the phase $\theta$ near the population maximum, providing robustness against drift and calibration fluctuations.

Extensions and Generalizations
The paper demonstrates that the D1p framework extends beyond single Fock-state preparation:

1. State Transfer: Efficient transfer between two Fock states $|m\rangle \to |n\rangle$ is achieved by optimizing the displacement from $|m\rangle$, often requiring fewer iterations than preparing from vacuum.
2. Detuned Drives: The protocol adapts to detuned drives where trajectories are circular rather than linear, requiring modified inverse pulses but preserving the amplification logic.
3. Selected Superpositions: A multi-target oracle can amplify a specific subspace (e.g., adjacent Fock states $|n-1\rangle$ and $|n\rangle$), preserving the relative amplitudes inherited from the initial coherent state.
4. Multi-legged Cat States: Preparing $L$-legged cat states (superpositions of $L$ coherent states) requires an iteration count determined solely by $L$. For $L \le 10$, only two iterations are needed, independent of the coherent-state amplitude.
5. Arbitrary Superpositions: While arbitrary superpositions are theoretically possible, they require a state-selective oracle rather than a simple multi-target phase, potentially increasing circuit depth.
6. Finite-Dimensional and Multipartite Systems: The principle applies to finite-dimensional systems (qudits) and multipartite entangled states by replacing displacements with general unitaries and utilizing joint controlled-phase gates.

Significance and Claims
The paper claims to provide a broadly applicable, scalable route to highly excited bosonic states on platforms supporting elementary controls (displacements and number-selective phases).

• Analytical Simplicity: The protocol requires no numerical optimization over the full Hilbert space; all parameters are derived in closed form.
• Hardware Agnosticism: The design separates the analytical state-preparation protocol from hardware-specific gate optimization, making it platform-independent.
• Scalability: By achieving $O(n^{1/4})$ scaling, the method addresses the critical need for faster preparation times to counteract occupation-enhanced loss in macroscopic quantum systems.
• Practicality: The use of standard operations (displacements and SNAP gates) and the robustness against parameter errors suggest immediate applicability to current superconducting circuit, trapped-ion, and optomechanical platforms.

The author concludes that while practical reach is limited by number-selective control fidelity, critical-photon constraints, and loss, the D1p protocol offers a significant step toward deterministic, high-fidelity preparation of non-Gaussian resources at macroscopic scales.