arXiv:2609.40226
A physical and universal model of bosonic computations with Solovay-Kitaev theorem
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani, Hamid Reza Naeij, Ulysse Chabaud, Sevag Gharibian, Saeed Mehraban
Abstract
Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong error-correction capabilities. However, standard bosonic quantum computation models such as the Lloyd-Braunstein [Lloyd and Braunstein, 1999] and hybrid oscillator-qubit models [Brenner, Dias, and Koenig, 2025; Liu et al., 2026] permit dramatic energy growth, leading to unphysical computational power and the breakdown of fundamental algorithmic tools such as universal and efficient compilation [Brenner et al., 2026; Rudolph et al., 2025]. To address this, we introduce a new model of bosonic quantum computation, Bosonic Energy-Preserving Quantum Computation (BEQC), in which energy is treated as a computational resource. Namely, energy is supplied solely through input coherent states, and all gates are generated by energy-preserving Hamiltonians. Thus, by construction, dramatic energy growth is impossible, making the model physically grounded. We next show that BEQC is a computationally robust and universal model in many respects, including: (1. Computational power) BEQC efficiently simulates all polynomial-energy computations in existing models, and exactly recovers BQP in the polynomial energy setting. It further admits several complexity-theoretic upper bounds when varying the energy, precision, and space parameters of the model. (2. Universal gate sets and state synthesis) BEQC has natural universal gate sets based on linear optics and Kerr interactions. In particular, we obtain a Solovay-Kitaev theorem which circumvents previous no-go results. We give various applications, including (a) a protocol for engineering GKP states with rigorous preparation guarantees, (b) Fock state preparation to exponential precision, and (c) native Fock space simulation of any qubit-based unitary.
AI Summary
Standard bosonic computation models allow rapid energy growth, complicating computational complexity and gate compilation. This paper introduces Bosonic Energy-Preserving Quantum Computation (BEQC): vacuum modes plus a coherent input $|\alpha\rangle$ supply energy $E=|\alpha|^2$, while gates are generated by local, constant-degree polynomial Hamiltonians commuting with total photon number. With polynomial time and energy and bounded error, BEQC equals $\mathsf{BQP}$. Related bounds include classical polynomial-time simulation with logarithmic energy and logarithmically many modes, and $\mathsf{PSPACE}$-completeness when nonlocal, polynomial-degree generators are permitted. The constructions use Fock-space truncation, qubit encodings, and number-conserving simulation. A rigorous parametric approximation replaces active Hamiltonians by number-conserving interactions with a coherent reservoir, with error $O(Mt/\alpha)$ under an appropriate energy-moment bound $M$. The central compilation result is a photon-cutoff Solovay–Kitaev theorem for linear optics plus self-Kerr or cross-Kerr gates. Arbitrary number-preserving unitaries can be approximated on total photon number at most $K$; when either mode count $m$ or $K$ is constant, compilation costs $\operatorname{poly}(m,K,\log(1/\varepsilon))$. Applications include deterministic, measurement-free GKP-state preparation on three modes with gate count polynomial in inverse state-width parameters and $1/\varepsilon$, and simulation of polynomial-energy computations in other models. Explicit counterexamples also demonstrate compilation obstructions and Trotter-induced energy growth in unrestricted active models. The theorem uses a sharp photon cutoff, not merely bounded mean energy; extending polylogarithmic precision dependence to the latter remains open. Non-number-preserving compilation can require energy polynomial in $1/\varepsilon$. General fault tolerance, practical architectures, and alternative universal gate sets remain unresolved.
The authors acknowledge the use of AI tools to assist with manuscript preparation and the development and verification of mathematical proofs.
Error found: The informal Solovay–Kitaev theorem claims approximation of every energy-preserving unitary without stating the vacuum-ancilla requirement, although the paper explicitly identifies that requirement for its formal theorem and restricts its ancilla-free alternative to sectorwise unit-determinant unitaries.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.