A Fourier Neural Operator Approach for Modelling Exciton-Polariton Condensate Systems

• URL: http://arxiv.org/abs/2309.15593v3
• Date: Thu, 22 May 2025 11:51:34 GMT
• Title: A Fourier Neural Operator Approach for Modelling Exciton-Polariton Condensate Systems
• Authors: Yuan Wang, Surya T. Sathujoda, Krzysztof Sawicki, Kanishk Gandhi, Angelica I Aviles-Rivero, Pavlos G. Lagoudakis,
• Abstract summary: Next-generation all-optical devices based on excitons have been proposed in latest years.<n>It is still challenging to predict their properties in a fast and accurate manner.<n>We propose a significantly more efficient machine-learning-based Fourier operator approach to find the solution.
• Score: 9.456480152126092
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A plethora of next-generation all-optical devices based on exciton-polaritons have been proposed in latest years, including prototypes of transistors, switches, analogue quantum simulators and others. However, for such systems consisting of multiple polariton condensates, it is still challenging to predict their properties in a fast and accurate manner. The condensate physics is conventionally described by Gross-Pitaevskii equations (GPEs). While GPU-based solvers currently exist, we propose a significantly more efficient machine-learning-based Fourier neural operator approach to find the solution to the GPE coupled with exciton rate equations, trained on both numerical and experimental datasets. The proposed method predicts solutions almost three orders of magnitude faster than CUDA-based solvers in numerical studies, maintaining the high degree of accuracy. Our method not only accelerates simulations but also opens the door to faster, more scalable designs for all-optical chips and devices, offering profound implications for quantum computing, neuromorphic systems, and beyond.

Related papers

• Designing quantum technologies with a quantum computer [1.4951795042951048]
  We develop a quantum-computer-aided framework for simulating devices using a general electron spin resonance Hamiltonian.<n>Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding algorithm.<n> Numerical simulations demonstrate the computation of autocorrelation functions up to $sim100$ ns, together with microwave absorption spectra.<n>We benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost.
  arXiv  Detail & Related papers  (2026-01-29T18:26:54Z)
• Analog quantum simulation of the Lipkin-Meshkov-Glick model in a transmon qudit [0.3372751145910977]
  We present an experimental realization of the Lipkin-Meshkov-Glick (LMG) model using an analog simulator based on a single superconducting transmon qudit with up to $d = 9$ levels.<n>This is accomplished by moving to a rotated frame in which evolution under any time-dependent local field and one-axis twisting can be realized.<n>We provide a detailed study of five finite-size precursors of quantum criticality in the LMG model.
  arXiv  Detail & Related papers  (2025-12-04T20:30:07Z)
• Exponentially reduced circuit depths in Lindbladian simulation [11.176767117446696]
  Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Existing methods face a critical trade-off: either relying on resource-intensive multi-qubit operations or employing deep quantum circuits to suppress simulation errors using experimentally friendly methods. We propose an efficient Lindbladian simulation framework that minimizes circuit depths while remaining experimentally accessible.
  arXiv  Detail & Related papers  (2024-12-30T16:31:25Z)
• NN-AE-VQE: Neural network parameter prediction on autoencoded variational quantum eigensolvers [1.7400502482492273]
  In recent years, the field of quantum computing has become significantly more mature. We present an auto-encoded VQE with neural-network predictions: NN-AE-VQE. We demonstrate these methods on a $H$ molecule, achieving chemical accuracy.
  arXiv  Detail & Related papers  (2024-11-23T23:09:22Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.<n>We generate hybrid quantum-classical algorithms that efficiently perform matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits [1.6268784011387605]
  This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation. We show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms.
  arXiv  Detail & Related papers  (2024-02-28T15:17:41Z)
• Differentiation of Linear Optical Circuits [0.0]
  Experimental setups based on linear optical circuits and single photon sources offer a promising platform for near-term quantum machine learning. We show that the derivative of the expectation values of a linear optical circuit can be computed by sampling from a larger circuit. In order to express derivative in terms of expectation values, we develop a circuit extraction procedure based on unitary dilation.
  arXiv  Detail & Related papers  (2024-01-15T22:43:22Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem [0.0]
  We present a methodology for simulating a phase transition in a pair of cavities that permit photon hopping. We find that the simulation can be performed with a modest amount of quantum resources.
  arXiv  Detail & Related papers  (2023-10-17T15:25:35Z)
• Simulating prethermalization using near-term quantum computers [1.2189422792863451]
  We propose an experimental protocol for probing dynamics and equilibrium properties on near-term digital quantum computers. We show that it is possible to study thermalization even with a relatively coarse Trotter decomposition of the Hamiltonian evolution of interest.
  arXiv  Detail & Related papers  (2023-03-15T09:04:57Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Iterative shaping of optical potentials for one-dimensional Bose-Einstein condensates [4.700873613415455]
  The ability to manipulate clouds of ultra-cold atoms is crucial for modern experiments on quantum manybody systems and quantum thermodynamics. This paper suggests the application of iterative learning control (ILC) methods to generate fine-tuned effective potentials in the presence of uncertainties and external disturbances.
  arXiv  Detail & Related papers  (2022-08-01T09:25:32Z)
• First design of a superconducting qubit for the QUB-IT experiment [50.591267188664666]
  The goal of the QUB-IT project is to realize an itinerant single-photon counter exploiting Quantum Non Demolition (QND) measurements and entangled qubits. We present the design and simulation of the first superconducting device consisting of a transmon qubit coupled to a resonator using Qiskit-Metal.
  arXiv  Detail & Related papers  (2022-07-18T07:05:10Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Non-linear Boson Sampling [0.0]
  We introduce the adoption of non-linear photon-photon interactions in the Boson Sampling framework. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities.
  arXiv  Detail & Related papers  (2021-10-26T15:41:51Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Benchmarking a novel efficient numerical method for localized 1D Fermi-Hubbard systems on a quantum simulator [0.0]
  We show that a quantum simulator can be used to in-effect solve for the dynamics of a many-body system. We use a neutral-atom Fermi-Hubbard quantum simulator with $L_textexpsimeq290$ lattice sites to benchmark its performance. We derive a simple prediction of the behaviour of interacting Bloch oscillations for spin-imbalanced Fermi-Hubbard systems.
  arXiv  Detail & Related papers  (2021-05-13T16:03:11Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.