Purification of photon subtraction from continuous squeezed light by filtering

Photon subtraction from squeezed states is a powerful scheme to create good approximation of so-called Schr\"odinger cat states. However, conventional continuous-wave-based methods actually involve some impurity in squeezing of localized wavepackets, even in the ideal case of no optical losses. Here we theoretically discuss this impurity, by introducing mode-match of squeezing. Furthermore, here we propose a method to remove this impurity by filtering the photon-subtraction field. Our method in principle enables creation of pure photon-subtracted squeezed states, which was not possible with conventional methods.Comment: 10 pages, 6 figure

Generation of optical Schr\"{o}dinger's cat states by generalized photon subtraction

We propose a high-rate generation method of optical Schr\"{o}dinger's cat states. Thus far, photon subtraction from squeezed vacuum states has been a standard method in cat-state generation, but its constraints on experimental parameters limit the generation rate. In this paper, we consider the state generation by photon number measurement in one mode of arbitrary two-mode Gaussian states, which is a generalization of conventional photon subtraction, and derive the conditions to generate high-fidelity and large-amplitude cat states. Our method relaxes the constraints on experimental parameters, allowing us to optimize them and attain a high generation rate. Supposing realistic experimental conditions, the generation rate of cat states with large amplitudes ($|\alpha| \ge 2)$ can exceed megacounts per second, about $10^3$ to $10^6$ times better than typical rates of conventional photon subtraction. This rate would be improved further by the progress of related technologies. Ability to generate non-Gaussian states at a high rate is important in quantum computing using optical continuous variables, where scalable computing platforms have been demonstrated but preparation of non-Gaussian states of light remains as a challenging task. Our proposal reduces the difficulty of the state preparation and open a way for practical applications in quantum optics.Comment: 8 pages, 5 figure

ZX Graphical Calculus for Continuous-Variable Quantum Processes

Continuous-variable (CV) quantum information processing is a promising candidate for large-scale fault-tolerant quantum computation. However, analysis of CV quantum process relies mostly on direct computation of the evolution of operators in the Heisenberg picture, and the features of CV space has yet to be thoroughly investigated in an intuitive manner. One key ingredient for further exploration of CV quantum computing is the construction of a computational model that brings visual intuition and new tools for analysis. In this paper, we delve into a graphical computational model, inspired by a similar model for qubit-based systems called the ZX calculus, that enables the representation of arbitrary CV quantum process as a simple directed graph. We demonstrate the utility of our model as a graphical tool to comprehend CV processes intuitively by showing how equivalences between two distinct quantum processes can be proven as a sequence of diagrammatic transformations in certain cases. We also examine possible applications of our model, such as measurement-based quantum computing, characterization of Gaussian and non-Gaussian processes, and circuit optimization.Comment: 34 pages, 3 figure

Gaussian breeding for encoding a qubit in propagating light

Practical quantum computing requires robust encoding of logical qubits in physical systems to protect fragile quantum information. Currently, the lack of scalability limits the logical encoding in most physical systems, and thus the high scalability of propagating light can be a game changer for realizing a practical quantum computer. However, propagating light also has a drawback: the difficulty of logical encoding due to weak nonlinearity. Here, we propose Gaussian breeding that encodes arbitrary Gottesman-Kitaev-Preskill (GKP) qubits in propagating light. The key idea is the efficient and iterable generation of quantum superpositions by photon detectors, which is the most widely used nonlinear element in quantum propagating light. This formulation makes it possible to systematically create the desired qubits with minimal resources. Our simulations show that GKP qubits above a fault-tolerant threshold, including ``magic states'', can be generated with a high success probability and with a high fidelity exceeding 0.99. This result fills an important missing piece toward practical quantum computing.Comment: 19 pages, 2 figure

Generation of Flying Logical Qubits using Generalized Photon Subtraction with Adaptive Gaussian Operations

The generation of a logical qubit called the Gottesman-Kitaev-Preskill qubit in an optical traveling wave is a major challenge for realizing large-scale universal fault-tolerant optical quantum computers. Recently, probabilistic generation of elementary GKP qubits has been demonstrated using photon number measurements and homodyne measurements. However, the generation rate is only a few Hz, and it will be difficult to generate fault-tolerant GKP qubits at a practical rate unless success probability is significantly improved. Here, we propose a method to efficiently synthesize GKP qubits from several quantum states by adaptive Gaussian operations. In the initial state preparation that utilizes photon number measurements, an adaptive operation allows any measurement outcome above a certain threshold to be considered as a success. This threshold is lowered by utilizing the generalized photon subtraction method. The initial states are synthesized into a GKP qubit by homodyne measurements and a subsequent adaptive operation. As a result, the single-shot success probability of generating fault-tolerant GKP qubits in a realistic scale system exceeds 10$\%$, which is one million times better than previous methods. This proposal will become a powerful tool for advancing optical quantum computers from the proof-of-principle stage to practical application.Comment: 9 pages, 3 figure