Stabilizer states are central to quantum computing, underlying quantum error correction, benchmarking, and efficient classical simulation. Yet their learnability exhibits a striking gap: an $n$-qubit stabilizer state can be learned from $\Theta(n)$ copies using two-copy Bell measurements, whereas non-adaptive single-co...
Demonstrating quantum advantage on current quantum hardware is a central goal of quantum computing, and random quantum circuits underpin many leading proposals. Yet sampling-based demonstrations are often difficult to verify, while observable-based approaches face a different challenge: concentration can suppress diffe...
A. A. Mele, Francesco Anna Mele, J. McClean et al.· 0 citations
Efficiently testing whether a quantum state possesses a given structure is both a fundamental and a practical task in quantum information. Among the most important structured families are Gaussian states, which underpin quantum optics and many-body physics while defining paradigmatic regimes of efficient classical simu...
A fundamental question in physics is: When does classical behavior emerge from quantum systems? Bosonic Gaussian states provide a natural setting to explore this quantum-classical boundary, as they capture both the classical field behavior and the intrinsic quantum nature of light. Here, we address this problem from a...
Senrui Chen, A. A. Mele, Francesco Anna Mele et al.· 0 citations
For every fixed design order $k$ and measurable-error tolerance, strong approximate unitary designs in optimal $\Theta(\log n)$ all-to-all circuit depth are constructed using only the original system qubits using a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble.
Teodor Parella-Dilmé, Júlia Barberà-Rodríguez, Salvatore F. E. Oliviero et al.· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
