2

Information recoverability of noisy quantum states
Extracting classical information from quantum systems is an essential step of many quantum algorithms. However, this information could …
PDF Cite DOI
Information recoverability of noisy quantum states
Lower bound the T-count via unitary stabilizer nullity
We introduce magic measures for multi-qubit quantum gates and establish lower bounds on the non-Clifford resources for fault-tolerant …
PDF Cite
Optimal Quantum Dataset for Learning a Unitary Transformation
Unitary transformations formulate the time evolution of quantum states. How to learn a unitary transformation efficiently is a …
PDF Cite DOI
Bounding the forward classical capacity of bipartite quantum channels
PDF Cite DOI
Exact entanglement cost of quantum states and channels under positive-partial-transpose-preserving operations
Copyright © 2018, arXiv, All rights reserved. This paper establishes single-letter formulas for the exact entanglement cost of …
PDF Cite DOI
Quantum algorithms for estimating quantum entropies
The von Neumann and quantum Rényi entropies characterize fundamental properties of quantum systems and lead to theoretical and …
PDF Cite
Variational quantum algorithms for trace distance and fidelity estimation
Estimating the difference between quantum data is crucial in quantum computing. However, as typical characterizations of quantum data …
PDF Cite DOI
Physical Implementability of Linear Maps and Its Application in Error Mitigation
Completely positive and trace-preserving maps characterize physically implementable quantum operations. On the other hand, general …
PDF Cite DOI
Practical distributed quantum information processing with LOCCNet
Distributed quantum information processing is essential for building quantum networks and enabling more extensive quantum computations. …
PDF Cite DOI
Variational Quantum Gibbs State Preparation with a Truncated Taylor Series
PDF Cite DOI