Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2408.10339 · Physical Review Research

Demonstration of hardware efficient photonic variational quantum algorithm

Iris Agresti, Koushik Paul, Peter Schiansky, Simon Steiner, Zhenghao Yin, Ciro Pentangelo, Simone Piacentini, Andrea Crespi, Yue Ban, Francesco Ceccarelli, Roberto Osellame, Xi Chen, Philip John Walther

Published Aug 29, 2025• 10 citations
arXivHTMLPDF

Abstract

Quantum computing has changed the paradigm of computer science, where quantum technologies have promised to outperform classical ones. Such an advantage was only demonstrated for tasks with no application or out of reach for the state-of-the-art quantum technologies. In this context, a promising strategy to find practical use of quantum computers exploits hybrid models, where a quantum device estimates a hard-to-compute quantity, while a classical optimizer trains the parameters. In this work, we demonstrate that single photons and linear optical networks are sufficient for implementing variational quantum algorithms, when the problem specification (ansatz) is tailored to this specific platform. We show this by a proof-of-principle demonstration to tackle an instance of a factorization task, whose solution is encoded in the ground state of a suitable Hamiltonian. This work, which combines Variational Quantum Algorithms with hardware efficient ansätze for linear optics, showcases a promising pathway toward practical applications for photonic quantum platforms.

DOI
10.1103/d7bb-ybfh

Related papers

A versatile single-photon-based quantum computing platform

Nicolas Maring, Andreas Fyrillas, Mathias Pont +26 more

Abstract Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promising technological approaches, photonic quantum computing offers the advantages of low decoherence, information processing with modest cryogenic requirements, and native integration with classical and quantum networks. So far, quantum computing demonstrations with light have implemented specific tasks with specialized hardware, notably Gaussian boson sampling, which permits the quantum computational advantage to be realized. Here we report a cloud-accessible versatile quantum computing prototype based on single photons. The device comprises a high-efficiency quantum-dot single-photon source feeding a universal linear optical network on a reconfigurable chip for which hardware errors are compensated by a machine-learned transpilation process. Our full software stack allows remote control of the device to perform computations via logic gates or direct photonic operations. For gate-based computation, we benchmark one-, two- and three-qubit gates with state-of-the art fidelities of 99.6 ± 0.1%, 93.8 ± 0.6% and 86 ± 1.2%, respectively. We also implement a variational quantum eigensolver, which we use to calculate the energy levels of the hydrogen molecule with chemical accuracy. For photon native computation, we implement a classifier algorithm using a three-photon-based quantum neural network and report a six-photon boson sampling demonstration on a universal reconfigurable integrated circuit. Finally, we report on a heralded three-photon entanglement generation, a key milestone toward measurement-based quantum computing.

arXiv:2306.00874•Nature Photonics•Mar 26, 2024•331 citations

Photonic variational quantum eigensolver for NISQ-compatible quantum technology

Kang-Min Hu, Min Namkung, Hyang-Tag Lim

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.

quant-pharXiv:2512.18952•Nano Convergence•Dec 23, 2025•2 citations

Parameter Shift Rule for Variational Photonic Quantum Circuit

Francesco Hoch, Giovanni Rodari, Taira Giordani +9 more

In recent years, variational quantum algorithms (VQA) have been receiving a great deal of attention, demonstrating their applicability in a wide range of tasks and implementable even in the noisy quantum processors currently available [1]. A VQA is a hybrid quantum-classical algorithm where a problem is encoded in a cost function that can be efficiently evaluated on a parametric quantum device and the minimum represents the desired solution. A classical optimizer can then be used to tune the parameters of the quantum device in order to minimize the loss function and find the optimal solution (Fig. 1). In the field of quantum computing, one of the main promising platforms is based on the use of single photons and integrated photonic circuits since photons are a natural choice for transferring information and have different degree of freedom that can be to encode the information. Moreover the use of integrated photonic allow the realization of compact and table complex interferometers with a high number of control parameters. Even if there are few applications [2], [3], VQA with photonic platforms remains a relatively unexplored subject. One of the main problems is the application of the classical optimizer to the photonic platform since most of the algorithms are based on the estimation of the gradient of the cost function with the finite difference method but that can not be applied to a noisy apparatus.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•0 citations

A general-purpose single-photon-based quantum computing platform

Niccolò Somaschi, Nicolas Maring, Nadia Belabas +3 more

Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promising technological approaches, photonic quantum computing offers the advantages of low decoherence, information processing with modest cryogenic requirements, and native integration with classical and quantum networks. To date, quantum computing demonstrations with light have implemented specific tasks with specialized hardware, notably Gaussian Boson Sampling which permitted quantum computational advantage to be reached. Here we report a first user-ready general-purpose quantum computing prototype based on single photons.

Quantum Computing, Communication, and Simulation•Mar 13, 2024•4 citations

Hybrid Quantum-Classical Algorithms for Quantum Computing Applications in Computational Physics

Julian Schuhmacher

Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.

•Jan 1, 2026•0 citations

Truncated Variational Hamiltonian Ansatz: efficient quantum circuit design for quantum chemistry and material science

Clemens Possel, Walter Hahn, Shirazi, Reza +4 more

Quantum computing has the potential to revolutionize quantum chemistry and material science by offering solutions to complex problems unattainable with classical computers. However, the development of efficient quantum algorithms that are efficient under noisy conditions remains a major challenge. This paper introduces the truncated Variational Hamiltonian Ansatz (tVHA), a novel circuit design for conducting quantum calculations on Noisy Intermediate-Scale Quantum (NISQ) devices. tVHA provides a promising approach for a broad range of applications by utilizing principles from the adiabatic theorem in solid state physics. Our proposed ansatz significantly reduces the parameter count and can decrease circuit size substantially, with a trade-off in accuracy. Thus, tVHA facilitates easier convergence within the variational quantum eigensolver framework compared to state-of-the-art ansätze such as Unitary Coupled Cluster (UCC) and Hardware-Efficient Ansatz (HEA). While this paper concentrates on the practical applications of tVHA in quantum chemistry, demonstrating its suitability for both weakly and strongly correlated systems and its compatibility with active space calculations, its underlying principles suggest a wider applicability extending to the broader field of material science computations on quantum computing platforms.

arXiv:2505.19772•May 26, 2025•4 citations
Quantum computing has changed the paradigm of computer science, where quantum technologies have promised to outperform classical ones. Such an advantage was only demonstrated for tasks with no application or out of reach for the state-of-the-art quantum technologies. In this context, a promising strategy to find practical use of quantum computers exploits hybrid models, where a quantum device estimates a hard-to-compute quantity, while a classical optimizer trains the parameters. In this work, we demonstrate that single photons and linear optical networks are sufficient for implementing variational quantum algorithms, when the problem specification (ansatz) is tailored to this specific platform. We show this by a proof-of-principle demonstration to tackle an instance of a factorization task, whose solution is encoded in the ground state of a suitable Hamiltonian. This work, which combines Variational Quantum Algorithms with hardware efficient ansätze for linear optics, showcases a promising pathway toward practical applications for photonic quantum platforms.
Abstract Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promising technological approaches, photonic quantum computing offers the advantages of low decoherence, information processing with modest cryogenic requirements, and native integration with classical and quantum networks. So far, quantum computing demonstrations with light have implemented specific tasks with specialized hardware, notably Gaussian boson sampling, which permits the quantum computational advantage to be realized. Here we report a cloud-accessible versatile quantum computing prototype based on single photons. The device comprises a high-efficiency quantum-dot single-photon source feeding a universal linear optical network on a reconfigurable chip for which hardware errors are compensated by a machine-learned transpilation process. Our full software stack allows remote control of the device to perform computations via logic gates or direct photonic operations. For gate-based computation, we benchmark one-, two- and three-qubit gates with state-of-the art fidelities of 99.6 ± 0.1%, 93.8 ± 0.6% and 86 ± 1.2%, respectively. We also implement a variational quantum eigensolver, which we use to calculate the energy levels of the hydrogen molecule with chemical accuracy. For photon native computation, we implement a classifier algorithm using a three-photon-based quantum neural network and report a six-photon boson sampling demonstration on a universal reconfigurable integrated circuit. Finally, we report on a heralded three-photon entanglement generation, a key milestone toward measurement-based quantum computing.
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.
In recent years, variational quantum algorithms (VQA) have been receiving a great deal of attention, demonstrating their applicability in a wide range of tasks and implementable even in the noisy quantum processors currently available [1]. A VQA is a hybrid quantum-classical algorithm where a problem is encoded in a cost function that can be efficiently evaluated on a parametric quantum device and the minimum represents the desired solution. A classical optimizer can then be used to tune the parameters of the quantum device in order to minimize the loss function and find the optimal solution (Fig. 1). In the field of quantum computing, one of the main promising platforms is based on the use of single photons and integrated photonic circuits since photons are a natural choice for transferring information and have different degree of freedom that can be to encode the information. Moreover the use of integrated photonic allow the realization of compact and table complex interferometers with a high number of control parameters. Even if there are few applications [2], [3], VQA with photonic platforms remains a relatively unexplored subject. One of the main problems is the application of the classical optimizer to the photonic platform since most of the algorithms are based on the estimation of the gradient of the cost function with the finite difference method but that can not be applied to a noisy apparatus.
Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promising technological approaches, photonic quantum computing offers the advantages of low decoherence, information processing with modest cryogenic requirements, and native integration with classical and quantum networks. To date, quantum computing demonstrations with light have implemented specific tasks with specialized hardware, notably Gaussian Boson Sampling which permitted quantum computational advantage to be reached. Here we report a first user-ready general-purpose quantum computing prototype based on single photons.
Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.
Quantum computing has the potential to revolutionize quantum chemistry and material science by offering solutions to complex problems unattainable with classical computers. However, the development of efficient quantum algorithms that are efficient under noisy conditions remains a major challenge. This paper introduces the truncated Variational Hamiltonian Ansatz (tVHA), a novel circuit design for conducting quantum calculations on Noisy Intermediate-Scale Quantum (NISQ) devices. tVHA provides a promising approach for a broad range of applications by utilizing principles from the adiabatic theorem in solid state physics. Our proposed ansatz significantly reduces the parameter count and can decrease circuit size substantially, with a trade-off in accuracy. Thus, tVHA facilitates easier convergence within the variational quantum eigensolver framework compared to state-of-the-art ansätze such as Unitary Coupled Cluster (UCC) and Hardware-Efficient Ansatz (HEA). While this paper concentrates on the practical applications of tVHA in quantum chemistry, demonstrating its suitability for both weakly and strongly correlated systems and its compatibility with active space calculations, its underlying principles suggest a wider applicability extending to the broader field of material science computations on quantum computing platforms.