Related papers: The unbearable hardness of deciding about magic
The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…
Quantum mechanics is widely regarded as a complete theory, yet we argue it is a tractable projection of a deeper, computationally-inaccessible classical variational structure. By analyzing the coupled partial differential equations of the…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
Despite significant effort, the quantum machine learning community has only demonstrated quantum learning advantages for artificial cryptography-inspired datasets when dealing with classical data. In this paper we address the challenge of…
Discordant states appear in a large number of quantum phenomena and seem to be a good indicator of divergence from classicality. While there is evidence that they are essential for a quantum algorithm to have an advantage over a classical…
Entanglement-assisted classical communication and transmission of a quantum system are the two quantum resources for information processing. Many information tasks can be performed using either quantum resource. However, this equivalence is…
The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often…
Quantum computing's promise lies in its intrinsic complexity, with entanglement initially heralded as its hallmark. However, the quest for quantum advantage extends beyond entanglement, encompassing the realm of nonstabilizer (magic)…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the…
Although the foundations of quantum and classical physics are much different, it is often difficult to pinpoint which features of a particular system are intrinsically "quantum". Perhapse, the most clear-cut distinction between "classical"…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
Entanglement bits or ``ebits'' have been proposed as a quantitative measure of a fundamental resource in quantum information processing. For such an interpretation to be valid, it is important to show that the same number of ebits in…
The "Power of One Qubit" refers to a computational model that has access to only one pure bit of quantum information, along with n qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is…
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous…
Entanglement is an important resource that allows quantum technologies to go beyond the classically possible. There are many ways quantum systems can be entangled, ranging from the archetypal two-qubit case to more exotic scenarios of…
Quantum scrambling refers to the spread of local quantum information into the many degrees of freedom of a quantum system. In this work, we introduce a resource theory of scrambling which incorporates two mechanisms, "entanglement…
Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed.…
By considering (non-relativistic) quantum mechanics as it is done in practice in particular in condensed-matter physics, it is argued that a deterministic, unitary time evolution within a chosen Hilbert space always has a limited scope,…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…