相关论文: Fast simulation of bosonic qubits via Gaussian fun…
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and…
We introduce a framework for simulating, on an $(n+1)$-qubit quantum computer, the action of a Gaussian Bosonic (GB) circuit on a state over $2^n$ modes. Specifically, we encode the initial bosonic state's expectation values over quadrature…
In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic…
Non-Gaussian operations are essential for most bosonic quantum technologies. Yet, realizable non-Gaussian gates are rather limited in type and generally suffer from accuracy-duration trade-offs. In this work, we propose to use quantum…
We introduce a complete description of a multi-mode bosonic quantum state in the coherent-state basis (which in this work is denoted as "$K$" function ), which---up to a phase---is the square root of the well-known Husimi "$Q$"…
Bosonic fault tolerant quantum computing requires preparations of Bosonic code states like cat states and GKP states with high fidelity and reliable quantum certification of these states. Although many proposals on preparing these states…
A promising route towards fault-tolerant quantum error correction is the concatenation of a Gottesman-Kitaev-Preskill (GKP) code with a qubit code. Development of such concatenated codes requires simulation tools which realistically model…
Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained…
Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP…
Classically simulating circuits with bosonic codes is challenging due to the prohibitive cost of simulating quantum systems with many, possibly infinite, energy levels. We propose an algorithm to simulate circuits with encoded…
Bosonic quantum error correction enables hardware-efficient protection of quantum information by encoding logical qubits in harmonic oscillators. Bosonic grid states, such as Gottesman-Kitaev-Preskill (GKP) states, are particularly…
Bosonic quantum error correction encodes a logical qubit in an oscillator, avoiding the hardware overhead of large qubit arrays. Among such encodings, Gottesman-Kitaev-Preskill (GKP) states are paticularly powerful because their phase-space…
We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither…
Simulating quantum states on a classical computer is hard, typically requiring prohibitive resources in terms of memory and computational power. Efficient simulation, however, can be achieved for certain classes of quantum states, in…
Quantum photonic simulators have emerged as indispensable tools for modeling and optimizing quantum photonic circuits, bridging the gap between theoretical models and experimental implementations. This review explores the landscape of…
Simulating out-of-equilibrium dynamics of quantum field theories in nature is challenging with classical methods, but is a promising application for quantum computers. Unfortunately, simulating interacting bosonic fields involves a high…
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes,…
We introduce a framework for simulating hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding. By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method…
Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a two-dimensional temporal continuous-variable cluster state. We first…
We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of…