相关论文: Stability of classical shadows under gate-dependen…
We introduce a post-processing technique for classical shadow measurement data that enhances the precision of ground state estimation through high-dimensional subspace expansion; the dimensionality is only limited by the amount of classical…
Shadow estimation provides an efficient framework for estimating observable expectation values using randomized measurements. While originally developed for discrete-variable systems, its recent extensions to continuous-variable (CV)…
To successfully perform quantum computations, it is often necessary to first accurately characterize the noise in the underlying hardware. However, it is well known that fundamental limitations prevent the unique identification of the…
The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range…
A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
We introduce a model of non-unitary quantum dynamics that exhibits infinitely long-lived discrete spatiotemporal order robust against any unitary or dissipative perturbation. Ergodicity is evaded by combining a sequence of projective…
A scalable Bayesian machine learning framework is introduced for estimating scalar properties of an unknown quantum state from measurement data, which bypasses full density matrix reconstruction. This work is the first to integrate the…
Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements on logarithmically many copies of rho in the size of P. In…
Predicting properties of complex, large-scale quantum systems is essential for developing quantum technologies. We present an efficient method for constructing an approximate classical description of a quantum state using very few…
Efficiently estimating fermionic Hamiltonian expectation values is vital for simulating various physical systems. Classical shadow (CS) algorithms offer a solution by reducing the number of quantum state copies needed, but noise in quantum…
We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable…
Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding…
Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in…
A crucial subroutine for various quantum computing and communication algorithms is to efficiently extract different classical properties of quantum states. In a notable recent theoretical work by Huang, Kueng, and Preskill [Nat. Phys. 16,…
Classical shadows (CS) have emerged as a powerful way to estimate many properties of quantum states based on random measurements and classical post-processing. In their original formulation, they come with optimal (or close to) sampling…
We present a comprehensive and self-contained framework for the efficient classical simulation of Clifford circuits acting on $d$-dimensional qudits, including realistic Pauli/Weyl noise via stochastic simulation. Our approach uses the…
Classical shadows constitute a protocol to estimate the expectation values of a collection of M observables acting on O(1) qubits of an unknown n-qubit state with a number of measurements that is independent of n and that grows only…
The code capacity threshold for error correction using qubits which exhibit asymmetric or biased noise channels is known to be much higher than with qubits without such structured noise. However, it is unclear how much this improvement…
Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the…