Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “continuous variables”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Information transmission with continuous variable quantum erasure channels

Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then derive the quantum capacity of the continuous variable erasure channel in the framework of decoupling theory. The discussion in this paper fills the gap of a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous-variable controlled-Z gate using an atomic ensemble

The continuous-variable controlled-Z gate is a canonical two-mode gate for universal continuous-variable quantum computation. It is considered as one of the most fundamental continuous-variable quantum gates. Here we present a scheme for realizing continuous-variable controlled-Z gate between two optical beams using an atomic ensemble. The gate is performed by simply sending the two beams propagating in two orthogonal directions twice through a spin-squeezed atomic medium. Its fidelity can run up to one if the input atomic state is infinitely squeezed. Considering the noise effects due to atomic decoherence and light losses, we show that the observed fidelities of the scheme are still quite high within presently available techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous variable quantum secret sharing

Continuous variable quantum secret sharing (CV-QSS) technologies are described that use laser sources and homodyne detectors. Here, a Gaussian-modulated coherent state (GMCS) prepared by one device passes through secure stations of other devices sequentially on its way to a trusted device, and each of the other devices coherently adds a locally prepared, independent GMCS to the group of propagating GMCSs. Finally, the trusted device measures both the amplitude and the phase quadratures of the received group of coherent GMCSs using double homodyne detectors. The trusted device suitably uses the measurement results to establish a secure key for encoding secret messages to be broadcast to the other devices. The devices cooperatively estimate, based on signals corresponding to their respective Gaussian modulations, the trusted device's secure key, so that the cooperative devices can decode the broadcast secret messages with the secure key.

97 MATHEMATICS AND COMPUTING↗

Disentanglement in bipartite continuous-variable systems

Entanglement in bipartite continuous-variable systems is investigated in the presence of partial losses such as those introduced by a realistic quantum communication channel, e.g., by propagation in an optical fiber. We find that entanglement can vanish completely for partial losses, in a situation reminiscent of so-called entanglement sudden death. Even states with extreme squeezing may become separable after propagation in lossy channels. Having in mind the potential applications of such entangled light beams to optical communications, we investigate the conditions under which entanglement can survive for all partial losses. Different loss scenarios are examined, and we derive criteria to test the robustness of entangled states. These criteria are necessary and sufficient for Gaussian states. Our study provides a framework to investigate the robustness of continuous-variable entanglement in more complex multipartite systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Concatenated dual displacement code for continuous-variable quantum error correction

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors. However, when the displacement magnitude becomes large, inevitable lattice-crossing errors arise beyond the correctable range of the GKP state. To address this issue, we concatenate the Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Contrary to conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against displacement errors at different scales: The inner GKP layer employs non-Gaussian resources to suppress continuous Gaussian noise and reduce residual variance, while the outer analog Steane code corrects discrete lattice-crossing events that exceed the GKP correctable range. It is precisely this separation of error-mitigation roles that enables CV error correction. In contrast to prior work on concatenating GKP and repetition codes to establish error correction for discrete qubit/qudit encoding, we provide correction in the continuous encoding space. Analytical studies show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors acting on all qumodes by up to 50%, while enabling unbiased correction of lattice-crossing errors with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture still provides Gaussian-error suppression and lattice-crossing correction. Moreover, the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides insight into the design of concatenated CV error-correcting architectures.

quantum error correction↗

Continuous-variable quantum Boltzmann machine

Here, we propose a continuous-variable quantum Boltzmann machine (CVQBM) using a powerful energy-based neural network. It can be realized experimentally on a continuous-variable (CV) photonic quantum computer. We used a CV quantum imaginary time evolution (QITE) algorithm to prepare the essential thermal state and then designed the CVQBM to proficiently generate continuous probability distributions. We applied our method to both classical and quantum data. Using real-world classical data, such as synthetic-aperture radar (SAR) images, we generated probability distributions. For quantum data, we used the output of CV quantum circuits. We obtained high fidelity and low Kullback–Leibler (KL) divergence showing that our CVQBM learns distributions from given data well and generates data sampling from that distribution efficiently. We also discussed the experimental feasibility of our proposed CVQBM. Our method can be applied to a wide range of real-world problems by choosing an appropriate target distribution (corresponding to, e.g., SAR images, medical images, and risk management in finance). Moreover, our CVQBM is versatile and could be programmed to perform tasks beyond generation, such as anomaly detection.

SAR images↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

Variational Optical Phase Learning on a Continuous-Variable Quantum Compiler

Quantum process learning is a fundamental primitive that draws inspiration from machine learning with the goal of better studying the dynamics of quantum systems. One approach to quantum process learning is quantum compilation, whereby an analog quantum operation is digitized by compiling it into a series of basic gates. While there has been significant focus on quantum compiling for discrete-variable systems, the continuous-variable (CV) framework has received comparatively less attention. We present an experimental implementation of a CV quantum compiler that uses two-mode squeezed light to learn a Gaussian unitary operation. We demonstrate the compiler by learning a parameterized linear phase unitary through the use of target and control phase unitaries to demonstrate a factor of 5.4 increase in the precision of the phase estimation and a 3.6-fold acceleration in the time-to-solution metric when leveraging quantum resources. We further show how our approach can be extended to higher-dimensional compilation tasks. Our results are enabled by the tunable control of our cost landscape via variable squeezing, thus providing a critical framework to simultaneously increase precision and reduce time-to-solution.

97 MATHEMATICS AND COMPUTING↗

Heralded processes on continuous-variable spaces as quantum maps

Heralding processes, which only work when a measurement on a part of the system give the good result, are particularly interesting for continuous-variables. They permit non-Gaussian transformations that are necessary for several continuous-variable quantum information tasks. However if maps and quantum process tomography are commonly used to describe quantum transformations in discrete-variable space, they are much rarer in the continuous-variable domain. Also, no convenient tool for representing maps in a way more adapted to the particularities of continuous variables have yet been explored. In this paper we try to fill this gap by presenting such a tool.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum simulation of quantum field theory using continuous variables

Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has lead to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is known to be hard using a classical computer. Thus, we give an experimental implementation based on cluster states that is feasible with today's technology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bell inequalities for continuous-variable measurements

Tests of local hidden-variable theories using measurements with continuous-variable (CV) outcomes are developed, and a comparison of different methods is presented. As examples, we focus on multipartite entangled Greenberger-Horne-Zeilinger and cluster states. We suggest a physical process that produces the states proposed here, and investigate experiments both with and without binning of the continuous variable. In the former case, the Mermin-Klyshko inequalities can be used directly. For unbinned outcomes, the moment-based Cavalcanti-Foster-Reid-Drummond inequalities are extended to functional inequalities by consideration of arbitrary functions of the measurements at each site. By optimizing these functions, we obtain more robust violations of local hidden-variable theories than with either binning or moments. Recent inequalities based on the algebra of quaternions and octonions are compared with these methods. Since the prime advantage of CV experiments is to provide a route to highly efficient detection via homodyne measurements, we analyze the effect of noise and detection losses in both binned and unbinned cases. The CV moment inequalities with an optimal function have greater robustness to both loss and noise. This could permit a loophole-free test of Bell inequalities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computation of SU(2) lattice gauge theory with continuous variables

We present a quantum computational framework for pure SU(2) lattice gauge theory, using continuous variables instead of discrete qubits to represent the infinite-dimensional Hilbert space of the gauge fields. We consider a ladder as well as a two-dimensional grid of plaquettes, detailing the use of gauge fixing to reduce the degrees of freedom and simplify the Hamiltonian. We demonstrate how system dynamics, ground states, and energy gaps can be computed using the continuous-variable approach to quantum computing. Our results indicate that it is feasible to study non-Abelian gauge theories with continuous variables, providing new avenues for understanding the real-time dynamics of quantum field theories.

Gauge Symmetry↗

Ancilla-free continuous-variable SWAP test

We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the computational basis measurement is replaced by photon number-resolving measurement, and we calculate an upper bound on the error of the overlap estimate obtained from a finite Fock cutoff in the detector. As an example, we show that estimation of the overlap of pure, centered, single-mode Gaussian states of energy E and squeezed in opposite quadratures can be obtained to error ϵ using photon statistics below a Fock basis cutoff O(Elnϵ –1 ). This cutoff is greatly reduced to E + O(√ Elnϵ –1 ) when the states have rapidly decaying Fock tails, such as coherent states. We show how the ancilla-free CV SWAP test can be extended to many modes and applied to quantum algorithms such as variational compiling and entanglement spectroscopy in the CV setting. For the latter we also provide a new algorithm which does not have an analog in qubit systems. The ancilla-free CV SWAP test is implemented on Xanadu's 8-mode photonic processor in order to estimate the vacuum probability of a two-mode squeezed state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Testing quantum contextuality of continuous-variable states

We investigate the violation of noncontextuality by a class of continuous-variable states, including variations of entangled coherent states and a two-mode continuous superposition of coherent states. We generalize the Kochen-Specker (KS) inequality discussed by Cabello [A. Cabello, Phys. Rev. Lett. 101, 210401 (2008)] by using effective bidimensional observables implemented through physical operations acting on continuous-variable states, in a way similar to an approach to the falsification of Bell-Clauser-Horne-Shimony-Holt inequalities put forward recently. We test for state-independent violation of KS inequalities under variable degrees of state entanglement and mixedness. We then demonstrate theoretically the violation of a KS inequality for any two-mode state by using pseudospin observables and a generalized quasiprobability function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inequalities for quantum marginal problems with continuous variables

We consider a mixed continuous-variable bosonic quantum system and present inequalities which must be satisfied between principal values of the covariances of a complete set of observables of the whole system and the principal values of the covariances of a complete set of observables of a subsystem. We use several classical results for the proof: the Courant-Fischer-Weyl min-max theorem for Hermitian operators and its consequence, the Cauchy interlacing theorem, and prove their analogues in the symplectic setting. For the case of passive transformations of Gaussian mixed states we also prove that the obtained inequalities are, in a sense, the best possible. The obtained mathematical results are applied to the system of n uncorrelated thermal modes of the electromagnetic field. Finally, we present the results of numerical simulations of the problem, suggesting avenues of further research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trigonometric continuous-variable gates and hybrid quantum simulations of the sine-Gordon model

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model. Using these gates, we prepare ground states via quantum imaginary-time evolution, simulate real-time dynamics, compute time-dependent vertex two-point correlation functions, and extract quantum kink profiles under topological boundary conditions. Our results demonstrate that trigonometric continuous-variable gates provide a physically natural framework for simulating interacting field theories on near-term hybrid quantum hardware, while establishing a parallel route to universality beyond polynomial gate constructions. We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

New Methods of Uncertainty Quantification for Mixed Discrete-Continuous Variable Models

The scale and complexity of problems such as designing power grids or planning for climate change is growing rapidly, driving the development of complicated computer models. More complex models have longer run times and incorporate larger numbers of inputs, both continuous and discrete. For example, a detailed physics model may have continuous variables such as temperature, height or pressure along with discrete variables that indicate the choice of a material for a particular piece or the model to be used to calculate air flow. A power grid design model may have continuous variables such as generation capacity, power flow or demand along with discrete variables such as number of generators, number of transmission lines or binary variables to indicate whether or not a node is chosen for generation expansion. A growing awareness of uncertainty and the desire to make risk-informed decisions is causing uncertainty quantification (UQ) to be more routine and often required. UQ provides the underpinnings necessary to establish confidence in models and their use; therefore, much time and effort is being invested in creating efficient approaches for UQ. However, these efforts have been focused on models that take continuous variables as inputs. When discrete inputs are thrown into the mix, the basic approach is to repeat the UQ analysis for each combination of discrete inputs or some subset thereof; this rapidly becomes intractable. Because of the computational complexity inherent in mixed discrete-continuous models, researchers will focus on the uncertainty in their particular problem finding ways to take advantage of symmetries, simplifications or structures. For example, uncertainty propagation in certain dynamical systems can be efficiently carried out after various decomposition steps or uncertainty propagation in stochastic programming is confined to scenario generation. Unfortunately models are not always available for such machinations: models may be embedded in legacy codes, may utilize commercial off the shelf codes or may be created by stringing a series of codes together. It is also time consuming to start each problem from scratch; worse there may not be any simplifications or symmetries to take advantage of. For these situations a UQ method developed for any black box function is necessary. This report documents a new conceptual model for performing UQ for mixed discrete-continuous models which not only applies to any simulator function, but allows the use of the efficient UQ methods that have been developed for continuous inputs only. The conceptual model is presented and an estimation procedure is fleshed out for one class of problems. This is applied to variations of a mixed discrete-continuous optimization test problem. This procedure provides comparable results to a benchmark solution with fewer function evaluations.

Bauman, Lara E.↗

On exchangeable continuous variable systems

We investigate permutation-invariant continuous variable quantum states and their covariance matrices. We provide a complete characterization of the latter with respect to permutation invariance and exchangeability and representing convex combinations of tensor power states. On the level of the respective density operators this leads to necessary criteria for all these properties which become necessary and sufficient for Gaussian states. For these we use the derived results to provide de Finetti-type theorems for various distance measures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗