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

Conference on Lasers and Electro-Optics

Variational Quantum Unsampling on a Programmable Nanophotonic Processor

Jacques Carolan, Masoud Mosheni, Jonathan P. Olson, Mihika Prabhu, Changchen Chen, Darius Bunandar, Nicholas C. Harris, Franco N. C. Wong, Michael Hochberg, Seth Lloyd, Dirk Englund

Published Jan 1, 2019• 1 citation
Publisher

Abstract

We introduce the Variational Quantum Unsampling (VQU) protocol, a nonlinear quantum neural network approach for verification and inference of near-term quantum circuits outputs. We experimentally demonstrate this protocol on a quantum photonic processor.
DOI
10.1364/cleo_qels.2019.fth3a.3

Related papers

Variational learning for quantum artificial neural networks

Francesco Tacchino, Panagiotis Kl. Barkoutsos, Chiara Macchiavello +3 more

In the last few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of Quantum Machine Learning aims at bringing together these two ongoing revolutions. Here we first review a series of recent works describing the implementation of artificial neurons and feed-forward neural networks on quantum processors. We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols. While keeping full compatibility with the overall memory-efficient feed-forward architecture, such a construction effectively reduces the quantum circuit depth required to determine the activation probability of single neurons upon input of the relevant data-encoding quantum states. This suggests a viable approach towards the use of quantum neural networks for pattern classification on near-term quantum hardware.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2020•17 citations

Variational Learning for Quantum Artificial Neural Networks

Francesco Tacchino, Stefano Mangini, Panagiotis Kl. Barkoutsos +4 more

In the past few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of quantum machine learning aims at bringing together these two ongoing revolutions. Here, we first review a series of recent works describing the implementation of artificial neurons and feedforward neural networks on quantum processors. We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols. We investigate different learning strategies involving global and local layerwise cost functions, and we assess their performances also in the presence of statistical measurement noise. While keeping full compatibility with the overall memory-efficient feedforward architecture, our constructions effectively reduce the quantum circuit depth required to determine the activation probability of single neurons upon input of the relevant data-encoding quantum states. This suggests a viable approach toward the use of quantum neural networks for pattern classification on near-term quantum hardware.

arXiv:2103.02498•IEEE Transactions on Quantum Engineering•Jan 1, 2021•50 citations

Variational quantum unsampling on a quantum photonic processor

Jacques Carolan, Masoud Mohseni, Jonathan P. Olson +9 more

arXiv:1904.10463•Nature Physics•Jan 13, 2020•90 citations

The trainability of photonic quantum circuits

Alexander Makarovskiy, Adam Taylor, Zhenghao Li +5 more

Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape. Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of sample variance to circuit variance. This ratio determines the number of circuit samples required to resolve local loss differences and gradients to proportional accuracy. We apply this framework to photon-number observables and identify both trainable and non-trainable regimes. Supported by analytic results and a numerically observed polynomial decay of the circuit variance, we find that fixed-order photon-number polynomials require only polynomially many samples as the system size grows, whereas high-order polynomials and observables based on output probabilities generally require exponentially many samples. Within the trainable regime, we further identify classes of observables in which quantum estimation achieves a polynomial speed-up over multiple classical methods. Within this family, neural network observables provide one practical construction that allow measurement outcomes to be efficiently processed into the desired polynomial. These results establish photonic variational quantum computing as a promising platform for near-term applications.

quant-pharXiv:2607.21544•Jul 24, 2026•0 citations

Variational Quantum Unsampling on an Photonic Quantum Processor

Jacques Carolan, Masoud Mohseni, Jonathan P. Olson +9 more

Bulletin of the American Physical Society•Mar 2, 2020•0 citations

A quantum algorithm to train neural networks using low-depth circuits

Guillaume Verdon, Michael Broughton, Jacob Biamonte

Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called classical-quantum hybrid variational algorithms. Here we develop a low-depth quantum algorithm to generative neural networks using variational quantum circuits. We introduce a method which employs the quantum approximate optimization algorithm as a subroutine in order produce then sample low-energy distributions of Ising Hamiltonians. We sample these states to train neural networks and demonstrate training convergence for numerically simulated noisy circuits with depolarizing errors of rates of up to $4\%$.

arXiv:1712.05304•Dec 14, 2017•86 citations
In the last few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of Quantum Machine Learning aims at bringing together these two ongoing revolutions. Here we first review a series of recent works describing the implementation of artificial neurons and feed-forward neural networks on quantum processors. We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols. While keeping full compatibility with the overall memory-efficient feed-forward architecture, such a construction effectively reduces the quantum circuit depth required to determine the activation probability of single neurons upon input of the relevant data-encoding quantum states. This suggests a viable approach towards the use of quantum neural networks for pattern classification on near-term quantum hardware.
In the past few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of quantum machine learning aims at bringing together these two ongoing revolutions. Here, we first review a series of recent works describing the implementation of artificial neurons and feedforward neural networks on quantum processors. We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols. We investigate different learning strategies involving global and local layerwise cost functions, and we assess their performances also in the presence of statistical measurement noise. While keeping full compatibility with the overall memory-efficient feedforward architecture, our constructions effectively reduce the quantum circuit depth required to determine the activation probability of single neurons upon input of the relevant data-encoding quantum states. This suggests a viable approach toward the use of quantum neural networks for pattern classification on near-term quantum hardware.
Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape. Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of sample variance to circuit variance. This ratio determines the number of circuit samples required to resolve local loss differences and gradients to proportional accuracy. We apply this framework to photon-number observables and identify both trainable and non-trainable regimes. Supported by analytic results and a numerically observed polynomial decay of the circuit variance, we find that fixed-order photon-number polynomials require only polynomially many samples as the system size grows, whereas high-order polynomials and observables based on output probabilities generally require exponentially many samples. Within the trainable regime, we further identify classes of observables in which quantum estimation achieves a polynomial speed-up over multiple classical methods. Within this family, neural network observables provide one practical construction that allow measurement outcomes to be efficiently processed into the desired polynomial. These results establish photonic variational quantum computing as a promising platform for near-term applications.
Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called classical-quantum hybrid variational algorithms. Here we develop a low-depth quantum algorithm to generative neural networks using variational quantum circuits. We introduce a method which employs the quantum approximate optimization algorithm as a subroutine in order produce then sample low-energy distributions of Ising Hamiltonians. We sample these states to train neural networks and demonstrate training convergence for numerically simulated noisy circuits with depolarizing errors of rates of up to 4%4\%4%.