338 citations · 936 across the 56 of their papers we have counts for
16 papers · 2 filters
Efficient certification of intractable quantum states with few Pauli measurements
Sami Abdul Sater, Maxime Garnier, Thierry Martinez +2
Efficient verification of quantum computational resources is crucial as experiments advance toward fault-tolerance. Universal quantum computation can be achieved by consuming resou…
Energy, Bosons and Computational Complexity
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth ra…
When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
Varun Upreti, Ulysse Chabaud, Zoë Holmes +1
Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable sys…
Shedding light on classical shadows: learning photonic quantum states
Hugo Thomas, Ulysse Chabaud, Pierre-Emmanuel Emeriau
Learning quantum state properties is both a fundamental and practical problem in quantum information theory. Classical shadows have emerged as an efficient method for estimating pr…
On the complex zeros of the wavefunction
Sacha Cerf, Clara Wassner, Jack Davis +2
The Schrödinger wavefunction is ubiquitous in quantum mechanics, quantum chemistry, and bosonic quantum information theory. Its zero-set for fermionic systems is well-studied and c…
Detecting quantum non-Gaussianity with a single quadrature
Clara Wassner, Jack Davis, Sacha Cerf +2
Full reconstruction of quantum states from measurement samples is often a prohibitively complex task, both in terms of the experimental setup and the scaling of the sample size wit…