Photonic variational quantum eigensolver for NISQ-compatible quantum technology

• URL: http://arxiv.org/abs/2512.18952v1
• Date: Mon, 22 Dec 2025 02:00:18 GMT
• Title: Photonic variational quantum eigensolver for NISQ-compatible quantum technology
• Authors: Kang-Min Hu, Min Namkung, Hyang-Tag Lim,
• Abstract summary: variational quantum eigensolver (VQE) is a leading approach for solving problems in quantum chemistry, many-body physics, and even integer factorization.<n>VQE can be implemented on various quantum hardware platforms, including photonic systems, quantum dots, trapped ions, neutral atoms, and superconducting circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Quantum-enhanced Computer Vision: Going Beyond Classical Algorithms [50.573955644831386]
  Quantum-enhanced Computer Vision (QeCV) is a new research field at the intersection of computer vision, machine learning and quantum computing.<n>It has high potential to transform how visual signals are processed and interpreted with the help of quantum computing.<n>This survey contributes to the existing literature on QeCV with a holistic review of this research field.
  arXiv  Detail & Related papers  (2025-10-08T17:59:51Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Quantum Algorithms Without Coherent Quantum Access [0.0]
  Most quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner.<n>It has been shown that without such an access, the quantum computer cannot be stronger than the classical counterparts.<n>In this work, we develop several variants of quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-04T11:24:28Z)
• State-Averaged Orbital-Optimized VQE: A quantum algorithm for the democratic description of ground and excited electronic states [0.0]
  The SA-OO-VQE package aims to answer both problems with its hybrid quantum-classical conception based on a typical Variational Quantum Eigensolver approach. The SA-OO-VQE has the ability to treat degenerate (or quasi-degenerate) states on the same footing, thus avoiding known numerical optimization problems around avoided crossings or conical intersections.
  arXiv  Detail & Related papers  (2024-01-22T12:16:37Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Quantum Computing Quantum Monte Carlo [8.69884453265578]
  We propose a hybrid quantum-classical algorithm that integrates quantum computing and quantum Monte Carlo. Our work paves the way to solving practical problems with intermediatescale and early-fault tolerant quantum computers.
  arXiv  Detail & Related papers  (2022-06-21T14:26:24Z)
• Continuous-variable quantum approximate optimization on a programmable photonic quantum processor [0.9558392439655016]
  Variational quantum algorithms (VQAs) provide a promising approach to achieving quantum advantage for practical problems on noisy quantum devices. We develop an automated collaborative computing system between a programmable photonic quantum computer and a classical computer. Our work can be extended to the minimization of more general functions, providing an alternative to achieve the quantum advantage in practical problems.
  arXiv  Detail & Related papers  (2022-06-15T00:00:47Z)
• Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum Simulation [5.188498150496968]
  We present a quantum kernel function (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems. As compared to its classical counterpart, namely the kernel method (KPM), QKFE has an exponential advantage in the cost of both time and memory. We demonstrate its efficiency with applications to one and two-dimensional quantum spin models, and a fermionic lattice.
  arXiv  Detail & Related papers  (2022-02-02T18:00:04Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Variational Quantum Algorithms [1.9486734911696273]
  Quantum computers promise to unlock applications such as large quantum systems or solving large-scale linear algebra problems. Currently available quantum devices have serious constraints, including limited qubit numbers and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which employ a classical simulation to train a parametrized quantum circuit, have emerged as a leading strategy to address these constraints.
  arXiv  Detail & Related papers  (2020-12-16T21:00:46Z)
• Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers [0.0]
  We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers. We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
  arXiv  Detail & Related papers  (2020-01-31T19:44:37Z)

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.