Related papers: Geometric and Resource-Theoretic Characterisation …
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum…
Quantum resources are certain features of the quantum world that provide advantages in certain information-theoretic, thermodynamic, or any other useful operational tasks that are outside the realm of what classical theories can achieve.…
Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work,…
In the realm of fault-tolerant quantum computing, stabilizer operations play a pivotal role, characterized by their remarkable efficiency in classical simulation. This efficiency sets them apart from non-stabilizer operations within the…
The current state of quantum computing is commonly described as the Noisy Intermediate-Scale Quantum era. Available computers contain a few dozens of qubits and can perform a few dozens of operations before the inevitable noise erases all…
Non-stabilizerness, or magic, is a fundamental resource for quantum computation, enabling quantum algorithms to surpass classical capabilities. Despite its importance, characterizing magic remains challenging due to the intricate geometry…
Lattice gauge theories (LGTs) represent one of the most ambitious goals of quantum simulation. From a practical implementation perspective, non-Abelian theories present significantly tougher challenges than Abelian LGTs. However, it is…
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible…
How well can quantum computers simulate classical dynamical systems? There is increasing effort in developing quantum algorithms to efficiently simulate dynamics beyond Hamiltonian simulation, but so far exact resource estimates are not…
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on…
Quantum computers promise dramatic advantages over their classical counterparts, but the answer to the most basic question "What is the source of the power in quantum computing?" has remained elusive. Here we prove a remarkable equivalence…
Genuinely quantum states of a harmonic oscillator may be distinguished from their classical counterparts by the Glauber-Sudarshan P-representation -- a state lacking a positive P-function is said to be nonclassical. In this paper, we…
The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending…
We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms we…
Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that,…
The relative power of quantum algorithms, using an adaptive access to quantum devices, versus classical post-processing methods that rely only on an initial quantum data set, remains the subject of active debate. Here, we present evidence…
We investigate the relationship between two distinct classical approaches to quantum systems: direct simulation from a classical description and sample-based learning from measurement data. While both tasks ultimately aim to reproduce…
We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of nonclassical advantages in computation. Completeness results from computational complexity theory lead to the identification of very…
Even after decades of quantum computing development, examples of generally useful quantum algorithms with exponential speedups over classical counterparts are scarce. Recent progress in quantum algorithms for linear-algebra positioned…