相关论文: Quantifying dynamical magic with completely stabil…
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…
Quantum systems can not be efficiently simulated classically due to the presence of entanglement and nonstabilizerness, also known as quantum magic. Here we study the generation of magic under evolution by a quantum circuit. To be able to…
A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their…
Catalysis refers to the possibility of enabling otherwise inaccessible quantum state transitions by supplying an auxiliary system, provided that the auxiliary is returned to its initial state at the end of the protocol. We show that…
A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements.…
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.…
Resource theory is a general, model-independent approach aiming to understand the qualitative notion of resource quantitatively. In a given resource theory, free operations are physical processes that do not create the resource and are…
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent…
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…
The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to…
No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we…
We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical…
Quantum state purification, a process that aims to recover a state closer to a system's principal eigenstate from multiple copies of an unknown noisy quantum state, is crucial for restoring noisy states to a more useful form in quantum…
A dynamical model for quantum channel is introduced which allows one to pass continuously from the memoryless case to the case in which memory effects are present. The quantum and classical communication rates of the model are defined and…
Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…
Monitored quantum systems, where unitary dynamics compete with continuous measurements, exhibit dynamical transitions as the measurement rate is varied. These reflect abrupt changes in the structure of the evolving wavefunction, captured by…
Free-space optical (FSO) links supporting spatial multiplexing provide a natural physical realization of Quantum MIMO channels. We develop a first-principles model for Quantum MIMO channels derived directly from wave-optical propagation…
We extend the recent proof of the Generalized Quantum Stein's Lemma by Hayashi and Yamasaki [arXiv:2408.02722] to classical-quantum (c-q) channels. We analyze the composite hypothesis testing problem of testing a c-q channel…
Quantum communications using continuous variables are quite mature experimental techniques and the relevant theories have been extensively investigated with various methods. In this paper, we study the continuous variable quantum channels…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…