# Experimental quantum advantage with quantum coupon collector

arXiv: https://arxiv.org/abs/2112.07884 · HTML: https://mlsanity.com/paper/2112.07884/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 7 of its 66 references that are in the map.
- First posted on arXiv 15 Dec 2021.

## Builds on (most cited first, 7 of 7)

- [Quantum Machine Learning](https://mlsanity.com/paper/1611.09347/) (2016)
- [Efficient Learning for Deep Quantum Neural Networks](https://mlsanity.com/paper/1902.10445/) (2019)
- [Continuous-variable quantum neural networks](https://mlsanity.com/paper/1806.06871/) (2018)
- [Quantum perceptron over a field and neural network architecture selection in a quantum computer](https://mlsanity.com/paper/1602.00709/) (2016)
- [Quantum Neural Network and Soft Quantum Computing](https://mlsanity.com/paper/1810.05025/) (2018)
- [Experimental relativistic zero-knowledge proofs](https://mlsanity.com/paper/2012.10452/) (2020)
- [Finite-key Analysis for Quantum Conference Key Agreement with Asymmetric Channels](https://mlsanity.com/paper/2109.11163/) (2021)

## Built on by (most cited first, 2 of 2)

- [Quantum Neural Network for Quantum Neural Computing](https://mlsanity.com/paper/2305.08544/) (2023)
- [Hybrid Classical-Quantum architecture for vectorised image classification of hand-written sketches](https://mlsanity.com/paper/2407.06416/) (2024)

## Abstract (arXiv)

An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes experimentally continues to be a central challenge because of the difficulty in preparing high-dimensional states or highly entangled states. In this study, we introduce and analyse a quantum coupon collector protocol by employing coherent states and simple linear optical elements, which was successfully demonstrated using realistic experimental equipment. We showed that our protocol can significantly reduce the number of samples needed to learn a specific set compared with the classical limit of the coupon collector problem. We also discuss the potential values and expansions of the quantum coupon collector by constructing a quantum blind box game. The information transmitted by the proposed game also broke the classical limit. These results strongly prove the advantages of quantum mechanics in machine learning and communication complexity.