Related Concept Videos
Sampling Theorem
The Quantum-Mechanical Model of an Atom
Norton's Theorem
Biot-Savart Law: Problem-Solving
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
The Uncertainty Principle
Second Uniqueness Theorem
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
You might also read
Related Articles
Articles linked to this work by shared authors, journal, and citation graph.
Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss.
Beating the Natural Grover Bound for Low-Energy Estimation and State Preparation.
Measuring correlation and entanglement between molecular orbitals on a trapped-ion quantum computer.
F-Divergences and Cost Function Locality in Generative Modelling with Quantum Circuits.
Quantum communication complexity advantage implies violation of a Bell inequality.
Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].
Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.
Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.
Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.
Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.
Related Experiment Video
Updated: Feb 18, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Provable and Verifiable Quantum Advantage in Sample Complexity.
Marcello Benedetti1, Harry Buhrman1,2,3, Jordi Weggemans2,4
1Quantinuum, London, United Kingdom.
This study introduces a quantum algorithm for complement sampling, efficiently finding elements in a complementary set. Quantum computation offers significant advantages over classical methods in sample complexity, especially for noisy intermediate-scale quantum devices.
Area of Science:
- Quantum Computing
- Computational Complexity
- Information Theory
Background:
- Complement sampling involves obtaining a sample from a complementary subset given samples from a subset.
- Classical algorithms require numerous samples for complement sampling, especially when subset sizes are large.
Purpose of the Study:
- To develop a quantum algorithm for complement sampling.
- To demonstrate quantum advantage in sample complexity compared to classical algorithms.
- To explore the potential for noisy intermediate-scale quantum (NISQ) computer implementations.
Main Methods:
- A simple quantum algorithm utilizing a single quantum sample (uniform superposition) was developed.
- Analysis of the algorithm's success probability and comparison with classical sample complexity bounds.
- Extension of results to prove average-case hardness.
Main Results:
- The quantum algorithm achieves a 100% success probability for complement sampling when subset sizes are equal (K=N/2).
- Classical algorithms require samples proportional to N for comparable success probability.
- The quantum approach demonstrates the largest possible separation in sample complexity.
Conclusions:
- Quantum computation offers provable and verifiable advantages in sample complexity for complement sampling.
- The algorithm is suitable for demonstration on NISQ computers.
- Complement sampling provides a pathway to quantum advantage under the assumption of one-way functions.
