Related papers: Quantifying magic via quantum $(\alpha,\beta)$ Jen…
A bottleneck for analyzing the interplay between magic and entanglement is the computation of these quantities in highly entangled quantum many-body magic states. Efficient extraction of entanglement can also inform our understanding of…
The notion of distance in Hilbert space is relevant in many scenarios. In particular, distances between quantum states play a central role in quantum information theory. An appropriate measure of distance is the quantum Jensen Shannon…
Magic states are the resource that allows quantum computers to attain an advantage over classical computers. This resource consists in the deviation from a property called stabilizerness which in turn implies that stabilizer circuits can be…
Magic (non-stabilizerness) is a key resource for achieving universal fault-tolerant quantum computation beyond classical computation. While previous studies have primarily focused on magic in single systems, its interactions and…
Magic states are fundamental building blocks on the road to fault-tolerant quantum computing. CSS codes play a crucial role in the construction of magic distillation protocols. Previous work has cast quantum computing with magic states for…
Any physical quantum device for quantum information processing is subject to errors in implementation. In order to be reliable and efficient, quantum computers will need error correcting or error avoiding methods. Fault-tolerance achieved…
Coherence is a fundamental ingredient in quantum physics and a key resource in quantum information processing. The quantification of quantum coherence is of great importance. We present a family of coherence quantifiers based on the Tsallis…
Quantum advantage is widely understood to rely on key quantum resources beyond entanglement, among which nonstabilizerness (quantum ``magic'') plays a central role in enabling universal quantum computation. However, the exact evaluation of…
We consider the costs and benefits of embedding the states of one quantum system within those of another. Such embeddings are ubiquitous, e.g., in error correcting codes and in symmetry-constrained systems. In particular we investigate the…
Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity…
Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A…
Quantum addition channels have been recently introduced in the context of deriving entropic power inequalities for finite dimensional quantum systems. We prove a reverse entropy power equality which can be used to analytically prove an…
Quantum magic, which accounts for the non-stabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. We investigate the generation and evolution of quantum magic in discrete-time…
The interplay between non-stabilizerness and entanglement in random states is a very rich arena of study for the understanding of quantum advantage and complexity. In this work, we tackle the problem of such interplay in random pure quantum…
Magic-state distillation (or non-stabilizer state manipulation) is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum computation. Related to non-stabilizer state manipulation is the…
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.…
We report the creation of a wide range of quantum states with controllable degrees of entanglement and entropy using an optical two-qubit source based on spontaneous parametric downconversion. The states are characterised using measures of…
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…
We introduce a novel measure for the quantum property of nonstabilizerness - commonly known as "magic" - by considering the R\'enyi entropy of the probability distribution associated to a pure quantum state given by the square of the…
Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet…