This work introduces an approach to quantum simulation by leveraging continuous-variable systems within a photonic hardware-inspired framework. The primary focus is on simulating static properties of the ground state of Hamiltonians associated with infinite-dimensional systems, such as those arising in quantum field theory. We present a continuous-variable variational quantum eigensolver compatible with state-of-the-art photonic technology. The framework we introduce allows us to compare discrete and continuous variable systems without introducing a truncation of the Hilbert space, opening the possibility to investigate the scenarios where one of the two formalisms performs better. We apply it to the study of static properties of the Bose-Hubbard model and demonstrate its effectiveness and practicality, highlighting the potential of continuous-variable quantum simulations in addressing complex problems in quantum physics. Published by the American Physical Society 2024
This work introduces an approach to quantum simulation by leveraging continuous-variable systems within a photonic hardware-inspired framework. The primary focus is on simulating static properties of the ground state of Hamiltonians associated with infinite-dimensional systems, such as those arising in quantum field theory. We present a continuous-variable variational quantum eigensolver compatible with state-of-the-art photonic technology. The framework we introduce allows us to compare discrete and continuous variable systems without introducing a truncation of the Hilbert space, opening the possibility to investigate the scenarios where one of the two formalisms performs better. We apply it to the study of static properties of the Bose-Hubbard model and demonstrate its effectiveness and practicality, highlighting the potential of continuous-variable quantum simulations in addressing complex problems in quantum physics. Published by the American Physical Society 2024
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
Quantum computers have the potential to deliver speed-ups for solving certain important problems that are intractable for classical counterparts, making them a promising avenue for advancing modern computation. However, many quantum algorithms require deep quantum circuits, which are challenging to implement on current noisy devices. To address this limitation, variational quantum algorithms (VQAs) have been actively developed, enabling practical quantum computing in the noisy intermediate-scale quantum (NISQ) era. Among them, the variational quantum eigensolver (VQE) stands out as a leading approach for solving problems in quantum chemistry, many-body physics, and even integer factorization. The VQE algorithm can be implemented on various quantum hardware platforms, including photonic systems, quantum dots, trapped ions, neutral atoms, and superconducting circuits. In particular, photonic platforms offer several advantages: they operate at room temperature, exhibit low decoherence, and support multiple degrees of freedom, making them suitable for scalable, high-dimensional quantum computation. Here we present methodologies for realizing VQE on photonic systems, highlighting their potential for practical quantum computing. We first provide a theoretical overview of the VQE framework, focusing on the procedure for variationally estimating ground state energies. We then explore how photonic systems can implement these processes, showing that a wide variety of problems can be addressed using either multiple qubit states or a single qudit state.
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 photonic quantum simulation, focusing on the transition from Gaussian to non-Gaussian models and the computational challenges associated with simulating large-scale photonic systems. Gaussian states and operations, which enable efficient simulations through covariance matrices and phase-space representations, serve as the foundation for photonic quantum computing. However, non-Gaussian states crucial for universal quantum computation introduce significant computational complexity, requiring advanced numerical techniques such as tensor networks and high-performance GPU acceleration. We evaluate the leading photonic quantum simulators, including Strawberry Fields, Piquasso, QuTiP SimulaQron, Perceval, and QuantumOPtics.jl analyzing their capabilities in handling continuous-variable (CV) and discrete-variable (DV) quantum systems. Special attention is given to hardware-accelerated methods, including GPU-based tensor network approaches, machine learning integration, and hybrid quantum-classical workflows. Furthermore, we investigate noise modeling techniques, such as photon loss and dark counts, and their impact on simulation accuracy. As photonic quantum computing moves toward practical implementations, advancements in high-performance computing (HPC) architectures, such as tensor processing units (TPUs) and system-on-a-chip (SoC) solutions, are accelerating the field. This review highlights emerging trends, challenges, and future directions for developing scalable and efficient photonic quantum simulators.
One of the methods proposed in recent years for studying nonperturbative gauge theory physics is quantum simulation, where lattice gauge theories are mapped onto quantum devices which can be built in the laboratory, or quantum computers. While being very promising and already showing some experimental results, these methods still face several challenges related to the interface between the technological capabilities and the demands of the simulated models; in particular, one such challenge is the need to simulate infinitely dimensional local Hilbert spaces, describing the gauge fields on the links in the case of compact Lie gauge groups, requiring some truncations and approximations which are not completely understood or controllable in the general case. This work proposes a way to obtain arbitrarily large such local Hilbert spaces by using coarse graining of simple, low-dimensional qubit systems, made of components available on most quantum simulation platforms, and thus opening the way to new types of lattice gauge theory quantum simulations. Published by the American Physical Society 2024
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 elusive. We address this gap by focusing on promoting circuits that are otherwise simulatable to computational universality. The class of simulatable, albeit non-Gaussian, circuits that we consider is composed of Gottesman-Kitaev-Preskill (GKP) states, Gaussian operations, and homodyne measurements. Based on these circuits, we first introduce a general framework for mapping a continuous-variable state into a qubit state. Subsequently, we cast existing maps into this framework, including the modular and stabilizer subsystem decompositions. By combining these findings with established results for discrete-variable systems, we formulate a sufficient condition for achieving universal quantum computation. Leveraging this, we evaluate the computational resourcefulness of a variety of states, including Gaussian states, finite-squeezing GKP states, and cat states. Furthermore, our framework reveals that both the stabilizer subsystem decomposition and the modular subsystem decomposition (of position-symmetric states) can be constructed in terms of simulatable operations. This establishes a robust resource-theoretical foundation for employing these techniques to evaluate the logical content of a generic continuous-variable state, which can be of independent interest. Published by the American Physical Society 2024
Background: Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly interacting many-body systems relevant to nuclear physics is, however, inefficient, even using ideal quantum computers. In addition, currently available noisy intermediate-scale quantum (NISQ) era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the noncommutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations.Purpose: The goal of the present study is to explore and utilize the noncommutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning.Method: We introduce an iterative hybrid classical-quantum algorithm, the Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wave function. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the logarithm of the size of the effective model space, rather than the particle number.Results: HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wave function, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cutoff as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for one- and two-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions.Conclusions: For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other nonperturbative EFTs.