Continuous-variable Quantum Computation Research Articles

Simulating quantum field theories on continuous-variable quantum computers

We delve into the use of photonic quantum computing to simulate quantum mechanics and extend its application towards quantum field theory. We develop and prove a method that leverages this form of continuous-variable quantum computing (CVQC) to reproduce the time evolution of quantum-mechanical states under arbitrary Hamiltonians, and we demonstrate the method's remarkable efficacy with various potentials. Our method centers on constructing an , a specially prepared quantum state that induces the desired time evolution on the target state. This is achieved by introducing a non-Gaussian operation using a measurement-based quantum computing approach, enhanced by machine learning. Furthermore, we propose a framework in which these methods can be extended to encode field theories in CVQC without discretizing the field values, thus preserving the continuous nature of the fields. This opens new avenues for quantum computing applications in quantum field theory. Published by the American Physical Society 2024

Deterministic Shaping of Quantum Light Statistics

We propose a theoretical method for the deterministic shaping of quantum light via photon number state selective interactions. Nonclassical states of light are an essential resource for high-precision optical techniques that rely on photon correlations and noise reshaping. Notable techniques include quantum enhanced interferometry, ghost imaging, and generating fault-tolerant codes for continuous variable optical quantum computing. We show that a class of nonlinear-optical resonators can transform many-photon wavefunctions to produce structured states of light with nonclassical noise statistics. The devices, based on parametric down conversion, utilize the Kerr effect to tune photon-number-dependent frequency matching, inducing photon-number-selective interactions. With a high-amplitude coherent pump, the number-selective interaction shapes the noise of a two-mode squeezed cavity state with minimal dephasing, illustrated with simulations. We specify the requisite material properties to build the device and highlight the remaining material degrees of freedom which offer flexible material design.

Continuous-Variable Quantum Computation in Circuit QED

Abstract

Robust atomic states for quantum information with continuous variables

Using a set of Zeeman sublevels of an alkali atom such as rubidium or sodium, we propose to construct a pair of coherentc population trap (CPT) states, which can be individually addressed and populated at will. The system can be arranged such that there exists a dressed state that is a linear combination of these two CPT states. We have earlier shown the capability of forming discrete quantum gates using this configuration [J.Phys. B, (2006), 39, 3919]. In the present communication, we will show how the same configuration can be used to prepare and operate continuously varying states. The state can be mapped to a 2D parametric space in such a way that any desired vector within it can be prepared, and a continuous, adiabatic evolution from one vector to another is also possible. A method to exploit a continuous interaction potential, which can be used in quantum computation, is also suggested. We discuss how a continuous variable quantum computation can be performed using such states.

Page curves and typical entanglement in linear optics

Bosonic Gaussian states are a special class of quantum states in an infinite dimensional Hilbert space that are relevant to universal continuous-variable quantum computation as well as to near-term quantum sampling tasks such as Gaussian Boson Sampling. In this work, we study entanglement within a set of squeezed modes that have been evolved by a random linear optical unitary. We first derive formulas that are asymptotically exact in the number of modes for the Rényi-2 Page curve (the average Rényi-2 entropy of a subsystem of a pure bosonic Gaussian state) and the corresponding Page correction (the average information of the subsystem) in certain squeezing regimes. We then prove various results on the typicality of entanglement as measured by the Rényi-2 entropy by studying its variance. Using the aforementioned results for the Rényi-2 entropy, we upper and lower bound the von Neumann entropy Page curve and prove certain regimes of entanglement typicality as measured by the von Neumann entropy. Our main proofs make use of a symmetry property obeyed by the average and the variance of the entropy that dramatically simplifies the averaging over unitaries. In this light, we propose future research directions where this symmetry might also be exploited. We conclude by discussing potential applications of our results and their generalizations to Gaussian Boson Sampling and to illuminating the relationship between entanglement and computational complexity.

Switching-free time-domain optical quantum computation with quantum teleportation

Optical switches and rerouting networks are considered essential in optical quantum computers where they are used for injection and dejection of the necessary quantum states into an optical quantum computer. Practical optical switches and rerouting networks are, however, experimentally challenging as they must have extremely low loss, small switching time, high repetition rate, and minimum optical nonlinearity, requirements that are difficult to achieve simultaneously. In this paper, we present an optical quantum computation platform that does not require such optical switches. Our method is based on continuous-variable measurement-based quantum computation where, instead of the typical cluster states, we modify the structure of the quantum entanglement, so that the quantum teleportation protocol can be employed instead of optical switching and rerouting. The quantum entanglement structure in our architecture has additional modes that allow quantum states to be teleported in or out of the computation along the cluster state, a task that normally requires optical switches. We also outline how to combine our platform with Gottesman-Kitaev-Preskill encoding, the currently most promising encoding for a continuous-variable system.

Quantum error correction in the lowest Landau level

We develop finite-dimensional versions of the quantum error-correcting codes proposed by Albert, Covey, and Preskill (ACP) for continuous-variable quantum computation on configuration spaces with non-Abelian symmetry groups. Our codes can be realized by a charged particle in a Landau level on a spherical geometry, in contrast to the planar Landau level realization of the qudit codes of Gottesman, Kitaev, and Preskill (GKP), or more generally by spin coherent states. Our quantum error-correction scheme is inherently approximate, and the encoded states may be easier to prepare than those of GKP or ACP.

Contextuality and Wigner Negativity Are Equivalent for Continuous-Variable Quantum Measurements.

Quantum computers promise considerable speedups with respect to their classical counterparts. However, the identification of the innately quantum features that enable these speedups is challenging. In the continuous-variable setting-a promising paradigm for the realization of universal, scalable, and fault-tolerant quantum computing-contextuality and Wigner negativity have been perceived as two such distinct resources. Here we show that they are in fact equivalent for the standard models of continuous-variable quantum computing. While our results provide a unifying picture of continuous-variable resources for quantum speedup, they also pave the way toward practical demonstrations of continuous-variable contextuality and shed light on the significance of negative probabilities in phase-space descriptions of quantum mechanics.

Measurement-based generation and preservation of cat and grid states within a continuous-variable cluster state

We present an algorithm to reliably generate various quantum states critical to quantum error correction and universal continuous-variable (CV) quantum computing, such as Schrödinger cat states and Gottesman-Kitaev-Preskill (GKP) grid states, out of Gaussian CV cluster states. Our algorithm is based on the Photon-counting-Assisted Node-Teleportation Method (PhANTM), which uses standard Gaussian information processing on the cluster state with the only addition of local photon-number-resolving measurements. We show that PhANTM can apply polynomial gates and embed cat states within the cluster. This method stabilizes cat states against Gaussian noise and perpetuates non-Gaussianity within the cluster. We show that existing protocols for breeding cat states can be embedded into cluster state processing using PhANTM.

Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding.

Quantum resource theories are a powerful framework for characterizing and quantifying relevant quantum phenomena and identifying processes that optimize their use for different tasks. Here, we define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. In contrast to previous literature, our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation. Particularly, we use the Gottesman-Kitaev-Preskill code to represent multiqubit states and consider the resource theory for the Wigner negativity. Our techniques are useful in finding resource lower bounds for different applications as state conversion and gate synthesis. The analytical expression of our magic measure allows us to extend current analysis limited to small dimensions, easily addressing systems of up to 12 qubits.

Protocol for Generating Optical Gottesman-Kitaev-Preskill States with Cavity QED.

Gottesman-Kitaev-Preskill (GKP) states are a central resource for fault-tolerant optical continuous-variable quantum computing. However, their realization in the optical domain remains to be demonstrated. Here we propose a method for preparing GKP states using a cavity QED system that can be realized in several platforms, such as trapped atoms, quantum dots, or diamond color centers. We then further combine the protocol with the previously proposed breeding protocol by Vasconcelos etal. to relax the demands on the quality of the QED system, finding that GKP states with more than 10dB squeezing could be achieved in near-future experiments.

Observation of Two-Mode Squeezing in a Traveling Wave Parametric Amplifier.

Traveling wave parametric amplifiers (TWPAs) have recently emerged as essential tools for broadband near quantum-limited amplification. However, their use to generate microwave quantum states still misses an experimental demonstration. In this Letter, we report operation of a TWPA as a source of two-mode squeezed microwave radiation. We demonstrate broadband entanglement generation between two modes separated by up to 400MHz by measuring logarithmic negativity between 0.27 and 0.51 and collective quadrature squeezing below the vacuum limit between 1.5 and 2.1dB. This work opens interesting perspectives for the exploration of novel microwave photonics experiments with possible applications in quantum sensing and continuous variable quantum computing.

A continuous variable Born machine

Generative modelling has become a promising use case for near-term quantum computers. Due to the fundamentally probabilistic nature of quantum mechanics, quantum computers naturally model and learn probability distributions, perhaps more efficiently than can be achieved classically. The quantum circuit Born machine is an example of such a model, easily implemented on near-term quantum computers. However, the Born machine was originally defined to naturally represent discrete distributions. Since probability distributions of a continuous nature are commonplace in the world, it is essential to have a model which can efficiently represent them. Some proposals have been made in the literature to supplement the discrete Born machine with extra features to more easily learn continuous distributions; however, all invariably increase the resources required. In this work, we discuss the continuous variable Born machine, built on the alternative architecture of continuous variable quantum computing, which is much more suitable for modelling such distributions in a resource-minimal way. We provide numerical results indicating the model’s ability to learn both quantum and classical continuous distributions, including in the presence of noise.

Research advances in continuous-variable quantum computation and quantum error correction

Quantum computation presents incomparable advantages over classical computer in solving some complex problems. To realize large-scale quantum computation, it is required to establish a hardware platform that is universal, scalable and fault tolerant. Continuous-variable optical system, which has unique advantages, is a feasible way to realize large-scale quantum computation and has attracted much attention in recent years. Measurement-based continuous-variable quantum computation realizes the computation by performing the measurement and feedforward of measurement results in large-scale Gaussian cluster states, and it provides an efficient method to realize quantum computation. Quantum error correction is an important part in quantum computation and quantum communication to protect quantum information. This review briefly introduces the basic principles and research advances in one-way quantum computation based on cluster states, quantum computation based on optical Schrödinger cat states and quantum error correction with continuous variables, and discusses the problems and challenges that the continuous-variable quantum computation is facing.

Non-Clifford gate on optical qubits by nonlinear feedforward

In a continuous-variable optical system, the Gottesman-Kitaev-Preskill (GKP) qubit is a promising candidate for fault-tolerant quantum computation. To implement non-Clifford operations on GKP qubits, non-Gaussian operations are required. In this context, the implementation of a cubic phase gate by combining nonlinear feedforward with ancillary states has been widely researched. Recently, however, it is pointed out that the cubic phase gate is not the most suitable for non-Clifford operations on GKP qubits. In this work, we show that we can achieve linear optical implementation of non-Clifford operations on GKP qubit with high fidelity by applying the nonlinear feedforward originally developed for the cubic phase gate and using a GKP-encoded ancillary state. Our work shows the versatility of nonlinear feedforward technique important for optical implementation of the fault-tolerant continuous-variable quantum computation.

Cluster States from Gaussian States: Essential Diagnostic Tools for Continuous-Variable One-Way Quantum Computing

Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states. It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels. In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system. Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm. By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.

Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture

Continuous variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction. However, no complete fault-tolerant architecture exists that includes everything from cluster state generation with finite squeezing to gate implementations with realistic noise and error correction. In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates by gate teleportation can be efficiently implemented. To accommodate scalability, we propose architectures that allow for both spatial and temporal multiplexing, with the temporal encoded version requiring as little as two squeezed light sources. Due to its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation. To validate fault-tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP-states as well as gate noise caused by finite squeezing in the cluster state. We find a fault-tolerant squeezing threshold of 12.7 dB with room for further improvement.

Unconditional Preparation of Squeezed Vacuum from Rabi Interactions.

Squeezed states of harmonic oscillators are a central resource for continuous-variable quantum sensing, computation, and communication. Here, we propose a method for the generation of very good approximations to highly squeezed vacuum states with low excess antisqueezing using only a few oscillator-qubit coupling gates through a Rabi-type interaction Hamiltonian. This interaction can be implemented with several different methods, which has previously been demonstrated in superconducting circuit and trapped-ion platforms. The protocol is compatible with other protocols manipulating quantum harmonic oscillators, thus facilitating scalable continuous-variable fault-tolerant quantum computation.

Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer

Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into states of light and the modern tools for their generation. Here we propose such a design for a scalable fault-tolerant photonic quantum computer informed by the latest developments in theory and technology. Central to our architecture is the generation and manipulation of three-dimensional resource states comprising both bosonic qubits and squeezed vacuum states. The proposal exploits state-of-the-art procedures for the non-deterministic generation of bosonic qubits combined with the strengths of continuous-variable quantum computation, namely the implementation of Clifford gates using easy-to-generate squeezed states. Moreover, the architecture is based on two-dimensional integrated photonic chips used to produce a qubit cluster state in one temporal and two spatial dimensions. By reducing the experimental challenges as compared to existing architectures and by enabling room-temperature quantum computation, our design opens the door to scalable fabrication and operation, which may allow photonics to leap-frog other platforms on the path to a quantum computer with millions of qubits.

Universal Gate Set for Continuous-Variable Quantum Computation with Microwave Circuits.

We provide an explicit construction of a universal gate set for continuous-variable quantum computation with microwave circuits. Such a universal set has been first proposed in quantum-optical setups, but its experimental implementation has remained elusive in that domain due to the difficulties in engineering strong nonlinearities. Here, we show that a realistic three-wave mixing microwave architecture based on the superconducting nonlinear asymmetric inductive element [Frattini etal., Appl. Phys. Lett. 110, 222603 (2017)APPLAB0003-695110.1063/1.4984142] allows us to overcome this difficulty. As an application, we show that this architecture allows for the generation of a cubic phase state with an experimentally feasible procedure. This work highlights a practical advantage of microwave circuits with respect to optical systems for the purpose of engineering non-Gaussian states and opens the quest for continuous-variable algorithms based on few repetitions of elementary gates from the continuous-variable universal set.