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:2405.04142 · Scientific Reports

Quantum-inspired clustering with light

J. J. M. Varga, Pablo Bermejo, Rubén Pellicer-Guridi, Román Orús, Gabriel Molina‐Terriza

Published Sep 17, 2024• 5 citations
arXivHTMLPDF

Abstract

This article introduces a novel approach to perform the simulation of a single qubit quantum-inspired algorithm using laser beams. Leveraging the polarization states of photonic qubits, and inspired by variational quantum eigensolvers, we develop a variational quantum-inspired algorithm implementing a clustering procedure following the approach proposed by some of us in SciRep 13, 13284 (2023). A key aspect of our research involves the utilization of non-orthogonal states within the photonic domain, harnessing the potential of polarization schemes to reproduce unitary circuits. By mapping these non-orthogonal states into polarization states, we achieve an efficient and versatile quantum information processing unit which serves as a clustering device for a diverse set of datasets.

DOI
10.1038/s41598-024-73053-z

Related papers

Variational quantum and quantum-inspired clustering

Pablo Bermejo, Román Orús

Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum devices. The idea of the algorithm relies on reducing the clustering problem to an optimization, and then solving it via a Variational Quantum Eigensolver combined with non-orthogonal qubit states. In practice, the method uses maximally-orthogonal states of the target Hilbert space instead of the usual computational basis, allowing for a large number of clusters to be considered even with few qubits. We benchmark the algorithm with numerical simulations using real datasets, showing excellent performance even with one single qubit. Moreover, a tensor network simulation of the algorithm implements, by construction, a quantum-inspired clustering algorithm that can run on current classical hardware.

arXiv:2206.09893•Scientific Reports•Aug 16, 2023•23 citations

On chip analysis of path-polarization hyperentangled cluster photon states

Mario Arnolfo Ciampini, Adeline Orieux, Stefano Paesani +9 more

Encoding many qubits in different degrees of freedom (DOFs) of single photons is one of the routes towards enlarging the Hilbert space spanned by a photonic quantum state. Hyperentangled photon states (i.e. states showing entanglement in multiple DOFs) have demonstrated significant implications for both fundamental physics tests and quantum communication and computation. Increasing the number of qubits of photonic experiments requires miniaturization and integration of the basic elements and functions to guarantee the set-up stability. This motivates the development of technologies allowing the control of different photonic DOFs on a chip. Femtosecond laser writing on a glass makes possible to use both path and polarization of photon states enabling precise control of both degrees of freedom. We demonstrate the contextual use of path and polarization qubits propagating within a laser written integrated quantum circuit and use them to engineer a four qubit hyperentangled cluster state. We also characterized the cluster state and exploited it to perform the Grover's search algorithm following the one-way quantum computation model. In addition, we tested the non-local properties of the cluster state by using multipartite non-locality tests.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 20, 2017•1 citation

Variational Quantum Simulation for Quantum Chemistry

Yifan Li, Jiaqi Hu, Xiao‐Ming Zhang +2 more

Abstract Variational quantum‐classical hybrid algorithms are emerging as important tools for simulating quantum chemistry with quantum devices. These algorithms can be applied to evaluate various molecular properties, including potential energy surfaces. Here in, recent progresses on the development of the so‐called variational quantum eigensolver (VQE) are surveyed. The eigensolver aims at reducing the consumption of quantum resources as much as possible. The key feature of VQE is that variation quantum states are optimized by a feedback process, where the measurement of the Hamiltonian is implemented term by term. This approach avoids the need of encoding all of the information about the molecular Hamiltonian in a quantum circuit. The VQE method is also compatible with classical methods in quantum chemistry, such as unitary coupled‐cluster ansatz. Furthermore, basic elements of VQE are covered, such as qubit encoding, mapping rules of the fermionic operators, ansatz preparation, together with several techniques for improving the performance, including constraining, and error mitigation.

Advanced Theory and Simulations•Jan 23, 2019•56 citations

Path Qubit Fusion for Photonic Cluster State Generation

Hee Su Park, Sang Min Lee, Jaeyoon Cho +2 more

This work describes an experimental fusion operation of photonic path qubits. This new method helps to construct a more complex cluster state composed of single-photon two-qubit states that possess both polarization and path qubits.

International Conference on Quantum Information•Jan 1, 2011•0 citations

Optical Quantum Computing

Hamza Hasnaoui, Leonardo Limongi, Taira Giordani +5 more

Under the label of optical quantum computing, there are a variety of protocols and experiments that use the quantum properties of light to achieve a computational advantage over classical computing machines. In this review, we describe some of the main implementations, which differ in the type of encoding and in how the computation is performed, whether using gates or cluster states. For each protocol, we describe advantages and challenges with an overview of the experimental results obtained, summarized in tables. Because of the great relevance achieved in this field, there is a section dedicated to non-universal quantum computation with photons, where boson sampling, variational quantum eigensolvers, and quantum machine learning applications are described. The aim is to give the reader the broadest overview of the applications where photons and their quantum properties play a key role in computation.

quant-pharXiv:2609.18347•Applied Physics Reviews•Sep 17, 2026•0 citations

Demonstration of hardware efficient photonic variational quantum algorithm

Iris Agresti, Koushik Paul, Peter Schiansky +10 more

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.

arXiv:2408.10339•Physical Review Research•Aug 29, 2025•10 citations
This article introduces a novel approach to perform the simulation of a single qubit quantum-inspired algorithm using laser beams. Leveraging the polarization states of photonic qubits, and inspired by variational quantum eigensolvers, we develop a variational quantum-inspired algorithm implementing a clustering procedure following the approach proposed by some of us in SciRep 13, 13284 (2023). A key aspect of our research involves the utilization of non-orthogonal states within the photonic domain, harnessing the potential of polarization schemes to reproduce unitary circuits. By mapping these non-orthogonal states into polarization states, we achieve an efficient and versatile quantum information processing unit which serves as a clustering device for a diverse set of datasets.
Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum devices. The idea of the algorithm relies on reducing the clustering problem to an optimization, and then solving it via a Variational Quantum Eigensolver combined with non-orthogonal qubit states. In practice, the method uses maximally-orthogonal states of the target Hilbert space instead of the usual computational basis, allowing for a large number of clusters to be considered even with few qubits. We benchmark the algorithm with numerical simulations using real datasets, showing excellent performance even with one single qubit. Moreover, a tensor network simulation of the algorithm implements, by construction, a quantum-inspired clustering algorithm that can run on current classical hardware.
Encoding many qubits in different degrees of freedom (DOFs) of single photons is one of the routes towards enlarging the Hilbert space spanned by a photonic quantum state. Hyperentangled photon states (i.e. states showing entanglement in multiple DOFs) have demonstrated significant implications for both fundamental physics tests and quantum communication and computation. Increasing the number of qubits of photonic experiments requires miniaturization and integration of the basic elements and functions to guarantee the set-up stability. This motivates the development of technologies allowing the control of different photonic DOFs on a chip. Femtosecond laser writing on a glass makes possible to use both path and polarization of photon states enabling precise control of both degrees of freedom. We demonstrate the contextual use of path and polarization qubits propagating within a laser written integrated quantum circuit and use them to engineer a four qubit hyperentangled cluster state. We also characterized the cluster state and exploited it to perform the Grover's search algorithm following the one-way quantum computation model. In addition, we tested the non-local properties of the cluster state by using multipartite non-locality tests.
Abstract Variational quantum‐classical hybrid algorithms are emerging as important tools for simulating quantum chemistry with quantum devices. These algorithms can be applied to evaluate various molecular properties, including potential energy surfaces. Here in, recent progresses on the development of the so‐called variational quantum eigensolver (VQE) are surveyed. The eigensolver aims at reducing the consumption of quantum resources as much as possible. The key feature of VQE is that variation quantum states are optimized by a feedback process, where the measurement of the Hamiltonian is implemented term by term. This approach avoids the need of encoding all of the information about the molecular Hamiltonian in a quantum circuit. The VQE method is also compatible with classical methods in quantum chemistry, such as unitary coupled‐cluster ansatz. Furthermore, basic elements of VQE are covered, such as qubit encoding, mapping rules of the fermionic operators, ansatz preparation, together with several techniques for improving the performance, including constraining, and error mitigation.
Under the label of optical quantum computing, there are a variety of protocols and experiments that use the quantum properties of light to achieve a computational advantage over classical computing machines. In this review, we describe some of the main implementations, which differ in the type of encoding and in how the computation is performed, whether using gates or cluster states. For each protocol, we describe advantages and challenges with an overview of the experimental results obtained, summarized in tables. Because of the great relevance achieved in this field, there is a section dedicated to non-universal quantum computation with photons, where boson sampling, variational quantum eigensolvers, and quantum machine learning applications are described. The aim is to give the reader the broadest overview of the applications where photons and their quantum properties play a key role in computation.
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.