Related papers: Limits on broadcasting non-stabilizerness through …
A fundamental question in quantum mechanics is, whether it is possible to replicate an arbitrary unknown quantum state. Then famous quantum no-cloning theorem [Nature 299, 802 (1982)] says no to the question. But it leaves open the…
We establish the best possible approximation to a perfect quantum cloning machine which produces two clones out of a single input. We analyze both universal and state-dependent cloners. The maximal fidelity of cloning is shown to be 5/6 for…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
The no-broadcasting theorem, a fundamental limitation on the communication of quantum information, holds that a physical process cannot broadcast copies of an unknown quantum state to two or more receivers. Recent work has explored ways of…
The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. We develop a general approach to this…
Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels,…
We construct a quantum machine which, by using asymmetric cloner, deals with disentangling and broadcasting entanglement in a single unitary evolution. The attainable maximum value of the scaling parameter $s$ for disentangling is identical…
Attempts at cloning a quantum system result in the introduction of imperfections in the state of the copies. This is a consequence of the no-cloning theorem, which is a fundamental law of quantum physics and the backbone of security for…
The problem of quantum state reduction in the process of measurement has attracted attention of almost everyone who created, developed or explained quantum physics to the students. Absence of a solution is the basis for the statement that…
Nonstabilizerness is a quantum property of states associated with the non-Clifford resources required for their preparation. As a resource, nonstabilizerness complements entanglement, and the interplay between these two concepts has…
The property of non-stabiliserness, or ``magic'', is of interest in quantum computing due to its role in developing fault-tolerant quantum algorithms with genuine computational advantage over classical counterparts. There has been much…
Magic or non-stabilizerness is a resource for quantum computing that has been extensively studied in qudit networks. It describes the degree to which Clifford gates cannot generate a given state, capturing the advantage of quantum over…
We investigate the dynamics of nonstabilizerness - also known as `magic' - in monitored quantum circuits composed of random Clifford unitaries and local projective measurements. For measurements in the computational basis, we derive an…
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical…
We show that inseparability of quantum states can be partially broadcasted (copied, cloned) with the help of local operations, i.e. distant parties sharing an entangled pair of spin 1/2 states can generate two pairs of partially nonlocally…
Quantum state preparation can be strikingly counterintuitive: the fastest route to a target state need not start from the apparently closest initial condition. We uncover such a quantum Mpemba effect in the dynamical generation of quantum…
We derive optimal cloning limits for finite Gaussian distributions of coherent states, and describe techniques for achieving them. We discuss the relation of these limits to state estimation and the no-cloning limit in teleportation. A…
We consider the quantum-state-diffusion dynamics of the XXZ-staggered spin chain, also focusing on its noninteracting XX-staggered limit, and of the Sachdev-Ye-Kitaev (SYK) model. We describe the process through quantum trajectories and…
Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient…
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation. To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is…