Optical Quantum Information with Non-Gaussian States

Quantum computing has been pursued with various hardware platforms and an optical system is one of the most reasonable choices for large-scale computation. In the optical continuous-variable computation scheme, the incorporation of Gaussian gates and a highly nonclassical non-Gaussian state enables universal quantum computation. Although basic technologies for Gaussian gates and non-Gaussian state generation have long been developed, these building blocks have not yet been integrated in a scalable fashion. Here, we integrate them to develop a scalable and programmable optical quantum computing platform that can sequentially perform an essential Gaussian gate, the squeezing gate, on a non-Gaussian input state. The key enablers are a loop-based optical circuit with dynamical and programmable controllability and its time synchronization with the probabilistic non-Gaussian state generation. We verify the deterministic, programmable, and repeatable quantum gates on a typical non-Gaussian state by implementing up to three-step gates. The gates implemented are of such high quality that strong evidence of the nonclassicalities of the states, the negativities of the Wigner functions, are preserved even after multistep gates. This platform is compatible with other non-Gaussian states and can in principle realize large-scale universal quantum computing by incorporating other existing processing technologies. Published by the American Physical Society 2025

Quantum optics has proved a fertile field for experimental tests of quantum information science, from experimental verification of the violation of the Bell inequalities to quantum teleportation. However it was long believed that quantum optics would not provide a practical path to efficient and scaleable quantum computation, and most current efforts to achieve a scaleable quantum computer have focussed on solid state implementations. This orthodoxy was challenged recently when Knill et al. showed that given single photon sources and single photon detectors, linear optics alone would suffice to implement efficient quantum computation. While this result is surprising, the complexity of the optical networks required is daunting. In this talk we propose an efficient scheme which is elegant in its simplicity. We indicate how fundamental single and two qubit gates can be achieved. By encoding the quantum information in multi-photon coherent states, rather than single photon states, simple optical manipulations acquire unexpected power. As an application of this new information processing ability we investigate a class of high precision measurements. We show how superpositions of coherent states allow displacement measurements at the Heisenberg limit. Entangling many superpositions of coherent states offers a significant advantage over a single mode superposition states with the same mean photon number.

Generation of high fidelity photonic non-Gaussian states is a crucial\ningredient for universal quantum computation using continous-variable\nplatforms, yet it remains a challenge to do so efficiently. We present a\ngeneral framework for a probabilistic production of multimode non-Gaussian\nstates by measuring few modes of multimode Gaussian states via\nphoton-number-resolving detectors. We use Gaussian elements consisting of\nsqueezed displaced vacuum states and interferometers, the only non-Gaussian\nelements consisting of photon-number-resolving detectors. We derive analytic\nexpressions for the output Wigner function, and the probability of generating\nthe states in terms of the mean and the covariance matrix of the Gaussian state\nand the photon detection pattern. We find that the output states can be written\nas a Fock basis superposition state followed by a Gaussian gate, and we derive\nexplicit expressions for these parameters. These analytic expressions show\nexactly what non-Gaussian states can be generated by this probabilistic scheme.\nFurther, it provides a method to search for the Gaussian circuit and\nmeasurement pattern that produces a target non-Gaussian state with optimal\nfidelity and success probability. We present specific examples such as the\ngeneration of cat states, ON states, Gottesman-Kitaev-Preskill states, NOON\nstates and bosonic code states. The proposed framework has potential\nfar-reaching implications for the generation of bosonic error-correction codes\nthat require non-Gaussian states, resource states for the implementation of\nnon-Gaussian gates needed for universal quantum computation, among other\napplications requiring non-Gaussianity. The tools developed here could also\nprove useful for the quantum resource theory of non-Gaussianity.\n

In optical quantum information processing with continuous variables, optical non-Gaussian quantum states are essential for universal and fault-tolerant quantum computation. Experimentally, their most typical generation method is photon subtraction (PS), where single-photon detection by an on/off detector probabilistically heralds the generation of squeezed single-photon states. In PS, however, trying to avoid unwanted multiphoton detection inevitably limits the generation rate, hindering the application of squeezed single-photon states. Here, we theoretically show that generalized photon subtraction (GPS), a simple extension of PS, can improve the generation rate while maintaining the quality of the generated states. Furthermore, we experimentally demonstrate the generation rate improvement for 2-dB- and 4-dB-squeezed single-photon states compared to PS, by more than one order of magnitude, particularly for the case of 2 dB. Our results will accelerate the application of squeezed single-photon states to more advanced quantum information protocols.

This chapter discusses quantum information science (QIS), quantum key distribution (QKD), and quantum teleportation. The new field of QIS encompasses several overlapping subdisciplines: quantum computing, quantum key distribution (also known as quantum cryptography), and quantum metrology (the measurement of small parameters and weak forces with ultra-high precision). In QIS, bits of information are encoded in quantum states, which themselves can be in superposition states and/or entanglement states. Generically, the 0 and 1 quantum bits are represented as qubits (quantum bits). QKD, or quantum cryptography, is a completely secure method of secret communication, and will remain so even if a quantum computer becomes available. Quantum teleportation is one of the more exotic features to have emerged from the field of QIS. It refers to the ability to transfer an unknown quantum state from one location to another, possibly very distant, location by using quantum entanglement.

Quantum computing is a multidisciplinary field at the intersectionof quantum physics, computer science, and mathematics, aiming to har-ness quantum mechanical phenomena for computational advantage. Thisarticle provides a comprehensive review of both the foundational princi-ples and advanced theoretical models of quantum computing. We beginwith the basic framework of quantum computation, introducing the con-cept of qubits as two-level quantum systems, the linear algebra of Hilbertspaces, Dirac’s bra–ket notation, and the postulates of quantum mechan-ics (state superposition, unitary evolution, and projective measurement).We then discuss quantum logic gates and circuits, highlighting how clas-sical reversible computation principles extend to universal quantum gatesets. Next, we survey key quantum algorithms (from Shor’s factoring toGrover’s searching and beyond) and the complexity-theoretic implicationsof quantum computers, contrasting the class BQP with classical complex-ity classes. We cover the theoretical foundations of quantum error cor-rection and fault tolerance, explaining how quantum information can beprotected from decoherence using redundancy and how fault-tolerant pro-tocols can, in principle, allow scalable quantum computation despite noisyhardware. We then explore advanced models and paradigms of quantumcomputation, including measurement-based quantum computing (one-wayquantum computing), topological quantum computation with anyons, adi-abatic quantum computing and quantum annealing, continuous-variablequantum computing, and related approaches. We also provide an overviewof quantum information theory as it relates to computation, discussingentanglement, quantum entropy, and information-theoretic limits like theHolevo bound. Finally, we review the leading physical implementations(quantum hardware models) of quantum computers—trapped ions, super-conducting circuits, photonic systems, solid-state spin qubits, and oth-ers—outlining the challenges and achievements of each approach.

Quantum information protocols range from subtle but straightforward — e.g., cryptography via quantum key distribution — to greatly complicated, notably quantum computation. To date, quantum cryptography has been realised in a variety of optical systems, whilst there is currently a worldwide effort to identify, implement and characterise suitable physical systems for quantum computation [1]. In this talk we look at optical systems for quantum computation, communication, and metrology.

In this work, we study the generation of non-Gaussian quantum states of light using multimode quantum resources. We first propose a theoretical framework to describe photon subtraction operation - a well known non-Gaussian operation - applied to a multimode Gaussian state. We apply this framework to the case of Schrödinger kitten state generation using a multimode squeezed vacuum as input state. We show that a monomode non-Gaussian state with high purity can be generated by a better choice of the different experimental parameters. Then, we propose a new protocol to generate high amplitude non-Gaussian states using spectral multiplexing of input states and Gaussian operations. We show that this protocol can implement the cat breeding operation with less complexity. We show also that this protocol can be used for the generation of approximated GKP state.

We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in a nested loop by an electrically programmable gate sequence. This architecture can process any input state and an arbitrary number of modes with almost minimum resources, and offers a universal gate set for both qubits and continuous variables. Furthermore, quantum computing can be performed fault tolerantly by a known scheme for encoding a qubit in an infinite-dimensional Hilbert space of a single light mode.

EPR steering is an asymmetric form of correlations which is intermediate between quantum entanglement and Bell nonlocality, and can be exploited for quantum communication with one untrusted party. In particular, steering of continuous variable Gaussian states has been extensively studied as a manifestation of the EPR paradox. While most of these studies focused on quadrature measurements for steering detection, two recent works revealed that there exist Gaussian states which are only steerable by non-Gaussian measurements. In this paper we perform a systematic investigation of EPR steering of bipartite Gaussian states by pseudospin measurements, complementing and extending previous findings. We first derive the density matrix elements of two-mode squeezed thermal states in the Fock basis, which may be of independent interest. We then use such a representation to investigate steering of these states as detected by a nonlinear criterion, based on second moments of the pseudospin correlation matrix. This analysis reveals previously unexplored regimes where non-Gaussian measurements are more effective than Gaussian ones to witness steering of Gaussian states in the presence of local noise. We further consider an alternative set of pseudospin observables, whose expectation value can be expressed compactly in terms of Wigner functions for all two-mode Gaussian states. However, according to the adopted criterion, these observables are found to be always less sensitive than Gaussian observables for steering detection. Finally, we investigate continuous variable Werner states, which are non-Gaussian mixtures of Gaussian states, and find that pseudospin measurements are always more effective than Gaussian ones to reveal their steerability. Our results provide useful insights on the role of non-Gaussian measurements in characterizing quantum correlations of Gaussian and non-Gaussian states.

Due to practical reasons, experimental and theoretical continuous-variable (CV) quantum information (QI) has been heavily based on Gaussian states. Nevertheless, many CV-QI protocols require the use of non-Gaussian states and operations. Here, we show that the Einstein-Podolsky-Rosen steering inequality can be used to obtain a practical witness for the generation of pure bipartite non-Gaussian states. While the scenario require pure states, we show its broad relevance by reporting the experimental observation of the non-Gaussianity of the CV two-photon state generated in the process of spontaneous parametric down-conversion (SPDC). The observed non-Gaussianity is due only to the intrinsic phase-matching conditions of SPDC

As a specific trait of quantum mechanics, quantum superposition is exploited in many applications such as quantum computation. This paper proposes a feedback scheme to stabilize the desired quantum superposition states. To this aim, a new factorization is derived for the stochastic master equation of a quantum system which is driven by the field in the superposition of coherent states. Then, a feedback scheme is proposed, which consists of a quantum system driven by the field in the superposition of coherent states and a classical feedback channel proportional to the observations of a Homodyne detector. Afterward, the quantum filter of the closed loop system is attained using the SLH framework. Finally, the factorization of the closed loop quantum filter is obtained and the control law is calculated such that the proposed factorization satisfies the stabilization condition. Finally, as an example, the control method is simulated for a two-level atom and the stabilization of the superposition states is achieved.

Quantum computers, although not yet available on the market, will revolutionise the future of information processing. Already now, quantum computers of special purpose, i.e., quantum simulators, are within reach. The physics of ultracold atoms, ions, and molecules offers unprecedented possibilities of control of quantum many systems, and novel possibilities of applications for quantum information and quantum metrology. Particularly fascinating is the possibility of using ultracold atoms in lattices to simulate condensed matter or even high energy physics. This book provides a comprehensive overview of ultracold lattice gases as quantum simulators, an interdisciplinary field involving atomic, molecular, and optical physics; quantum optics; quantum information; and condensed matter and high energy physics. It includes some introductory chapters on basic concepts and methods, and focuses on the physics of spinor, dipolar, disordered, and frustrated lattice gases, before reviewing in detail artificial lattice gauge fields with ultracold gases. The last part of the book moves onto a discussion of possible implementations universal quantum computers with ultracold atoms. After a crash course in quantum information theory, several models of quantum computation with ultracold gases are presented, as well as the current understanding of condensed matter from a quantum information perspective. The book ends with the general discussion of various detection methods that are unique for ultracold atoms.

Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit entangled states are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process. In our model there are two participants, a client who prepares initial single-qubit states and a server that performs universal quantum computation. The client is almost classical since she does not require any quantum computational power, quantum memory. To realize the client's universal BQC, we construct an $m\times n$ latticed state composed of six-qubit cluster states and eight-qubit cluster states, which needs less qubits than the brickwork state. Finally, we analyze and prove the blindness, correctness, universality and verifiability of our proposed BQC protocol.

Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires X and Z-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only X and Z-basis measurements. Furthermore, in order to demonstrate an advantage of our hypergraph state, we construct a verifiable blind quantum computing protocol that requires only X and Z-basis measurements for the client.