Publications

The distillable randomness of a bipartite quantum state is an information-theoretic quantity equal to the largest net rate at which …

Unitary transformations formulate the time evolution of quantum states. How to learn a unitary transformation efficiently is a …

We introduce magic measures for multi-qubit quantum gates and establish lower bounds on the non-Clifford resources for fault-tolerant …

Copyright © 2018, arXiv, All rights reserved. This paper establishes single-letter formulas for the exact entanglement cost of …

An emerging direction of quantum computing is to establish meaningful quantum applications in various fields of artificial …

Variational quantum algorithms (VQAs) are expected to establish valuable applications on near-term quantum computers. However, recent …

Exploring quantum applications of near-term quantum devices is a rapidly growing field of quantum information science with both …

Extracting classical information from quantum systems is an essential step of many quantum algorithms. However, this information could …

Estimating the difference between quantum data is crucial in quantum computing. However, as typical characterizations of quantum data …

Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator …

Quantum neural networks (QNNs) have emerged as a leading strategy to establish applications in machine learning, chemistry, and …

Completely positive and trace-preserving maps characterize physically implementable quantum operations. On the other hand, general …

Quantum gates and measurements on quantum hardware are inevitably subject to hardware imperfections that lead to quantum errors. …

Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement …

We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information …

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses …

Singular value decomposition is central to many problems in engineering and scientific fields. Several quantum algorithms have been …

Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders …

Measurements on near-term quantum processors are inevitably subject to hardware imperfections that lead to readout errors. Mitigation …

A paradigmatic algorithm for online learning is the Hedge algorithm by Freund and Schapire. An allocation into different strategies is …

Distributed quantum information processing is essential for building quantum networks and enabling more extensive quantum computations. …

Quantum entanglement is a key resource in quantum technology, and its quantification is a vital task in the current Noisy …

© 2020 American Physical Society. The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in …

Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such …

The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the …

We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using …

Magic state manipulation is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum …

Online quantum state learning is a recently proposed problem by Aaronson et al. (2018), where the learner sequentially predicts …

This paper develops the resource theory of asymmetric distinguishability for quantum channels, generalizing the related resource theory …

This paper systematically develops the resource theory of asymmetric distinguishability, as initiated roughly a decade ago [K. …

The unextendibility or monogamy of entangled states is a key property of quantum entanglement. Unlike conventional ways of expressing …

To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other …

We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the …

The traditional perspective in quantum resource theories concerns how to use free operations to convert one resourceful quantum state …

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regime. …

Non-asymptotic entanglement distillation studies the trade-off between three parameters: the distillation rate, the number of …

We study the one-shot and asymptotic quantum communication assisted with the positive-partial-transpose-preserving (PPT) and …

The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory, due to …

Coherent superposition is a key feature of quantum mechanics that underlies the advantage of quantum technologies over their classical …

We show a meaningful theory of classical communication over quantum channels when assisted by no-signalling (NS) and PPT-preserving …

This paper describes a quantum programming environment, named $Q|SIångle$. It is a platform embedded in the .Net language that supports …

This paper establishes single-letter formulas for the exact entanglement cost of generating bipartite quantum states and simulating …

The ability to distill quantum coherence is key for the implementation of quantum technologies; however, such a task cannot always be …

We develop a general framework to assess capabilities and limitations of the Gaussian toolbox in continuous variable quantum …

We characterize the distillation of quantum coherence in the one-shot setting, that is, the conversion of general quantum states into …

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regime. …

We study the problem of transforming a tripartite state to a bipartite one using stochastic local operations and classical …

Quantum Lovász number, as a natural generalization of the celebrated Lovśz number in graph theory, is the best known efficiently …

We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve positivity …

Broadcasting quantum and classical information is a basic task in quantum information processing, and is also a useful model in the …

Rains' bound is arguably the best known upper bound of the distillable entanglement by operations completely preserving positivity of …

A bipartite subspace $S$ is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer …

© 2016 American Physical Society.An additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper …

© 2016 IEEE.Using one channel to simulate another exactly with the aid of quantum no-signalling correlations has been studied recently. …

© 2016 IEEE.Recently the power of positive partial transpose preserving (PPTp) and no-signalling (NS) codes in quantum communication …

We study the activated quantum no-signalling-assisted zero-error classical capacity by first allowing the assistance from some …

test