Experimental quantum advantage with quantum coupon collector
arXiv:2112.07884 · doi:10.34133/2022/9798679
Abstract
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.
arXiv comment10 pages, 3 figures, 3 tables, Accepted by Research
References in corpus (41)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Quantum computational advantage using photons
- Secure quantum key distribution with realistic devices
- Quantum Convolutional Neural Networks
- Overcoming the rate-distance barrier of quantum key distribution without using quantum repeaters
- Characterizing Quantum Supremacy in Near-Term Devices
- Efficient Learning for Deep Quantum Neural Networks
- Quantum Secure Direct Communication with Quantum Memory
- Photonic Boson Sampling in a Tunable Circuit
- Non-locality and Communication Complexity
- Quantum advantage with shallow circuits
- Continuous-variable quantum neural networks
- Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
- Quantum generalisation of feedforward neural networks
- Experimental Scattershot Boson Sampling
- Long-Distance Measurement-Device-Independent Multiparty Quantum Communication
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- The SWAP test and the Hong-Ou-Mandel effect are equivalent
- No imminent quantum supremacy by boson sampling
- Machine learning method for state preparation and gate synthesis on photonic quantum computers
- Quantum autoencoders to denoise quantum data
- Architectures for quantum simulation showing a quantum speedup
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Unitary quantum perceptron as efficient universal approximator
- Experimental Quantum Fingerprinting
- Experimental Gaussian Boson Sampling
- Experimental plug&play quantum coin flipping
- Quantum Fingerprinting with Coherent States and a Constant Mean Number of Photons
- Single-qubit optical quantum fingerprinting
- Observation of quantum fingerprinting beating the classical limit
- Secure Quantum Secret Sharing without Signal Disturbance Monitoring
- Finite-key Analysis for Quantum Conference Key Agreement with Asymmetric Channels
- One-qubit fingerprinting schemes
- Experimental demonstration of quantum advantage for one-way communication complexity
- Experimental demonstration of quantum advantage for NP verification with limited information
- Experimental relativistic zero-knowledge proofs
- Quantum superiority for verifying NP-complete problems with linear optics
- Homodyne Detection Quadrature Phase Shift Keying Continuous-Variable Quantum Key Distribution with High Excess Noise Tolerance
- Quantum Neural Network and Soft Quantum Computing
Cited by in corpus (12)
- Quantum Neural Network for Quantum Neural Computing
- Demonstration of algorithmic quantum speedup
- Breaking Rate-Distance Limitation of Measurement-Device-Independent Quantum Secret Sharing
- Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution
- Asynchronous Quantum Repeater using Multiple Quantum Memory
- Breaking universal limitations on quantum conference key agreement without quantum memory
- All-Photonic Quantum Repeater for Multipartite Entanglement Generation
- Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks
- Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
- Phase-Matching Quantum Key Distribution without Intensity Modulation
- Information-theoretically secure quantum timestamping with one-time universal hashing
- Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement