arXiv subjects

Xiao Yuan

Publications and source records attributed to Xiao Yuan.

At least 127 records · Page 7Linked to original sources

arXiv2019

Quantum Coherence and Intrinsic Randomness

The peculiar uncertainty or randomness of quantum measurements stems from coherence, whose information-theoretic characterization is currently under investigation. Under the resource theory of coherence, it is interesting to investigate interpretations of coherence measures and the interplay with other quantum properties, such as quantum correlations and intrinsic randomness. Coherence can be viewed as the resource for the intrinsic randomness in the measurement outcomes of a state in the computational basis. We observed in our previous work that the coherence of formation, which measures the asymptotic coherence dilution rate, indeed quantifies the uncertainty of a (classical) correlated party about the system measurement outcome. In this work, we re-derive the result from a quantum point of view and then connect the intrinsic randomness to the relative entropy of coherence, another important coherence measure that quantifies the asymptotic distillable coherence. Even though there does not exist bound coherent states, these two intrinsic randomness quantified by coherence of formation and the relative entropy of coherence are different. Interestingly, we show that this gap is equal to the quantum discord, a general form of quantum correlations, in the state of the system of interest and the correlated party, after a local measurement on the former system.

quant-ph↗

arXiv2019

Detecting multipartite entanglement structure with minimal resources

Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.

quant-ph↗

arXiv2019

Theory of variational quantum simulation

The variational method is a versatile tool for classical simulation of a variety of quantum systems. Great efforts have recently been devoted to its extension to quantum computing for efficiently solving static many-body problems and simulating real and imaginary time dynamics. In this work, we first review the conventional variational principles, including the Rayleigh-Ritz method for solving static problems, and the Dirac and Frenkel variational principle, the McLachlan's variational principle, and the time-dependent variational principle, for simulating real time dynamics. We focus on the simulation of dynamics and discuss the connections of the three variational principles. Previous works mainly focus on the unitary evolution of pure states. In this work, we introduce variational quantum simulation of mixed states under general stochastic evolution. We show how the results can be reduced to the pure state case with a correction term that takes accounts of global phase alignment. For variational simulation of imaginary time evolution, we also extend it to the mixed state scenario and discuss variational Gibbs state preparation. We further elaborate on the design of ansatz that is compatible with post-selection measurement and the implementation of the generalised variational algorithms with quantum circuits. Our work completes the theory of variational quantum simulation of general real and imaginary time evolution and it is applicable to near-term quantum hardware.

quant-ph↗

arXiv2019

Variational ansatz-based quantum simulation of imaginary time evolution

Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum computers can efficiently simulate quantum systems, but not non-unitary imaginary time evolution. We propose a variational algorithm for simulating imaginary time evolution on a hybrid quantum computer. We use this algorithm to find the ground-state energy of many-particle systems; specifically molecular hydrogen and lithium hydride, finding the ground state with high probability. Our method can also be applied to general optimisation problems and quantum machine learning. As our algorithm is hybrid, suitable for error mitigation and can exploit shallow quantum circuits, it can be implemented with current quantum computers.

quant-ph↗

arXiv2019

Operational Resource Theory of Quantum Channels

Quantum resource theories have been widely studied to systematically characterize the non-classicality of quantum systems. Most resource theories focus on quantum states and study their interconversions. Although quantum channels are generally used as the tool for state manipulation, such a manipulation capability can be naturally regarded as a generalized quantum resource, leading to an open research direction in the resource theories of quantum channels. Various resource-theoretic properties of channels have been investigated, however, without treating channels themselves as operational resources that can also be manipulated and converted. In this Letter, we address this problem by first proposing a general resource framework for quantum channels and introducing resource monotones based on general distance quantifiers of channels. We study the interplay between channel and state resource theories by relating resource monotones of a quantum channel to its manipulation power of the state resource. Regarding channels as operational resources, we introduce asymptotic channel distillation and dilution, the most important tasks in an operational resource theory, and show how to bound the conversion rates with channel resource monotones. Finally, we apply our results to quantum coherence as an example and introduce the coherence of channels, which characterizes the coherence generation ability of channels. We consider asymptotic channel distillation and dilution with maximally incoherent operations and find the theory asymptotically irreversible, in contrast to the asymptotic reversibility of the coherence of states.

quant-ph↗

arXiv2019

Operational interpretation of coherence in quantum key distribution

Quantum coherence was recently formalized as a physical resource to measure the strength of superposition. Based on the resource theory, we present a systematic framework that connects a coherence measure to the security of quantum key distribution. By considering a generic entanglement-based key distribution protocol under the collective attack scenario, we show that the key rate can be quantified by the coherence of the shared bipartite states. This framework allows us to derive the key rate of the BB84 and six-state protocols. By utilizing fine-grained parameters, we also derive the improved key rates of both protocols within the coherence-based framework. Furthermore, we apply it to a practical issue, detection efficiency mismatch, and obtain an improved result. In conclusion, this framework demonstrates the interplay among coherence, entanglement, and quantum key distribution at a fundamental level.

quant-ph↗

arXiv2019

Error-mitigated digital quantum simulation

Variational algorithms may enable classically intractable simulations on near-future quantum computers. However, their potential is limited by hardware errors. It is therefore crucial to develop efficient ways to mitigate these errors. Here, we propose a stabiliser-like method which enables the detection of up to 60 - 80 % of depolarising errors. Our method is suitable for near-term quantum hardware. Simulations show that our method can significantly benefit calculations subject to both stochastic and correlated noise, especially when combined with existing error mitigation techniques.

quant-ph↗

arXiv2019

Quantifying Coherence with Untrusted Devices

Device-independent (DI) tests allow to witness and quantify the quantum feature of a system, such as entanglement, without trusting the implementation devices. Although DI test is a powerful tool in many quantum information tasks, it generally requires nonlocal settings. Fundamentally, the superposition property of quantum states, quantified by coherence measures, is a distinct feature to distinguish quantum mechanics from classical theories. In literature, witness and quantification of coherence with trusted devices have been well-studied. However, it remains open whether we can witness and quantify single party coherence with untrusted devices, as it is not clear whether the concept of DI tests exists without a nonlocal setting. In this work, we study DI witness and quantification of coherence with untrusted devices. First, we prove a no-go theorem for a fully DI scenario, as well as a semi DI scenario employing a joint measurement with trusted ancillary states. We then propose a general prepare-and-measure semi DI scheme for witnessing and quantifying the amount of coherence. We show how to quantify the relative entropy and the $l_1$ norm of single party coherence with analytical and numerical methods. As coherence is a fundamental resource for tasks such as quantum random number generation and quantum key distribution, we expect our result may shed light on designing new semi DI quantum cryptographic schemes.

quant-ph↗

arXiv2019

Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor

Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental challenges: Direct analog implementation requires complex Hamiltonian engineering, while the digitised version needs deep quantum gate circuits. To bypass these obstacles, we suggest an adiabatic variational hybrid algorithm, which employs short quantum circuits and provides a systematic quantum adiabatic optimisation of the circuit parameters. The quantum adiabatic theorem promises not only the ground state but also that the excited eigenstates can be found. We report the first experimental demonstration that many-body eigenstates can be efficiently prepared by an adiabatic variational algorithm assisted with a multi-qubit superconducting coprocessor. We track the real-time evolution of the ground and exited states of transverse-field Ising spins with a fidelity up that can reach about 99%.

quant-ph↗

arXiv2019

Coherence as a resource for source-independent quantum random-number generation

Measuring quantum states provides means to generate genuine random numbers. It has been shown that genuine randomness can be obtained even with an uncharacterized quantum source. In this work, we propose a framework that formalizes the idea of realizing source-independent quantum random number generation via measuring coherence. Without full state tomography, the coherence of the source can be estimated by coherence witnesses. The existing uncertainty-relation-based schemes can be treated as special cases under the coherence framework, as we design a nonlinear coherence witness that can essentially yield the same results. Meanwhile, we propose a source-independent random number generation scheme, which can achieve a higher randomness generation rate than the uncertainty-relation-based ones.

quant-ph↗

arXiv2019

A high threshold code for modular hardware with asymmetric noise

We consider an approach to fault tolerant quantum computing based on a simple error detecting code operating as the substrate for a conventional surface code. We develop a customised decoder to process the information about the likely location of errors, obtained from the error detect stage, with an advanced variant of the minimum weight perfect matching algorithm. A threshold gate-level error rate of 1.42% is found for the concatenated code given highly asymmetric noise. This is superior to the standard surface code and remains so as we introduce a significant component of depolarising noise; specifically, until the latter is 70% the strength of the former. Moreover, given the asymmetric noise case, the threshold rises to 6.24% if we additionally assume that local operations have 20 times higher fidelity than long range gates. Thus for systems that are both modular and prone to asymmetric noise our code structure can be very advantageous.

quant-ph↗

arXiv2019

Efficient and robust detection of multipartite Greenberger-Horne-Zeilinger-like states

Entanglement is a key resource for quantum information processing. A widely used tool for detecting entanglement is entanglement witness, where the measurement of the witness operator is guaranteed to be positive for all separable states and can be negative for certain entangled states. In reality, due to the exponentially increasing the Hilbert-space dimension with respective to the system size, it is very challenging to construct an efficient entanglement witness for general multipartite entangled states. For $N$-partite Greenberger-Horne-Zeilinger (GHZ)-like states, the most robust witness scheme requires $N+1$ local measurement settings and can tolerate up to $1/2$ white noise. As a comparison, the most efficient witness for GHZ-like states only needs two local measurement settings and can tolerate up to $1/3$ white noise. There is a trade-off between the realization efficiency, the number of measurement settings, and the detection robustness, the maximally tolerable white noise. In this work, we study this trade-off by proposing a family of entanglement witnesses with $k$ ($2\le k\le N+1$) local measurement settings. Considering symmetric local measurements, we calculate the maximal tolerable noise for any given number of measurement settings. Consequently, we design the optimal witness with a minimal number of settings for any given level of white noise. Our theoretical analysis can be applied to other multipartite entangled states with a strong symmetry. Our witnesses can be easily implemented in experiment and applied in practical multipartite entanglement detection under different noise conditions.

quant-ph↗

arXiv2019

One-Shot Coherence Distillation: Towards Completing the Picture

The resource framework of quantum coherence was introduced by Baumgratz, Cramer and Plenio [PRL 113, 140401 (2014)] and further developed by Winter and Yang [PRL 116, 120404 (2016)]. We consider the one-shot problem of distilling pure coherence from a single instance of a given resource state. Specifically, we determine the distillable coherence with a given fidelity under incoherent operations (IO) through a generalisation of the Winter-Yang protocol. This is compared to the distillable coherence under maximal incoherent operations (MIO) and dephasing-covariant incoherent operations (DIO), which can be cast as a semidefinite programme, that has been presented previously by Regula et al. [PRL 121, 010401 (2018)]. Our results are given in terms of a smoothed min-relative entropy distance from the incoherent set of states, and a variant of the hypothesis-testing relative entropy distance, respectively. The one-shot distillable coherence is also related to one-shot randomness extraction. Moreover, from the one-shot formulas under IO, MIO, DIO, we can recover the optimal distillable rate in the many-copy asymptotics, yielding the relative entropy of coherence. These results can be compared with previous work by some of the present authors [Zhao et al., PRL 120, 070403 (2018)] on one-shot coherence formation under IO, MIO, DIO and also SIO. This shows that the amount of distillable coherence is essentially the same for IO, DIO, and MIO, despite the fact that the three classes of operations are very different. We also relate the distillable coherence under strictly incoherent operations (SIO) to a constrained hypothesis testing problem and explicitly show the existence of bound coherence under SIO in the asymptotic regime.

quant-ph↗

arXiv2018

One-Shot Coherence Dilution

Manipulation and quantification of quantum resources are fundamental problems in quantum physics. In the asymptotic limit, coherence distillation and dilution have been proposed by manipulating infinite identical copies of states. In the non-asymptotic setting, finite data-size effects emerge, and the practically relevant problem of coherence manipulation using finite resources has been left open. This letter establishes the one-shot theory of coherence dilution, which involves converting maximally coherent states into an arbitrary quantum state using maximally incoherent operations, dephasing-covariant incoherent operations, incoherent operations, or strictly incoherent operations. We introduce several coherence monotones with concrete operational interpretations that estimate the one-shot coherence cost --- the minimum amount of maximally coherent states needed for faithful coherence dilution. Furthermore, we derive the asymptotic coherence dilution results with maximally incoherent operations, incoherent operations, and strictly incoherent operations as special cases. Our result can be applied in the analyses of quantum information processing tasks that exploit coherence as resources, such as quantum key distribution and random number generation.

quant-ph↗

arXiv2018

Relative entropies of quantum channels with applications in resource theory

Entropic quantifiers of states lie at the cornerstone of the quantum information theory. While a quantum state can be abstracted as a device that only has outputs, the most general quantum device is a quantum channel that also has inputs. In this work, we extend the entropic quantifiers of states to the ones of channels. In the one-shot and asymptotic scenarios, we propose relative entropies of channels under the task of hypothesis testing. Then, we define the entropy of channels based on relative entropies from the target channel to the completely depolarising channel. We also study properties of relative entropies of channels and the interplay with entanglement. Finally, based on relative entropies of channels, we propose general resource theories of channels and discuss the coherence of general channels and measurements, and the entanglement of channels.

quant-ph↗

arXiv2018

Unification of quantum resources in distributed scenarios

Quantum resources, such as coherence, discord, and entanglement, play as a key role for demonstrating advantage in many computation and communication tasks. In order to find the nature behind these resources, tremendous efforts have been made to explore the connections between them. In this work, we extend the single party coherence resource framework to the distributed scenario and relate it to basis-dependent discord. We show the operational meaning of basis-dependent discord in quantum key distribution. By formulating a framework of basis-dependent discord, we connect these quantum resources, coherence, discord, and entanglement, quantitatively, which leads to a unification of measures of different quantum resources.

quant-ph↗

arXiv2018

Mitigating algorithmic errors in Hamiltonian simulation

Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing $N$, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps $N_{\textrm{opt}}$ given a physical error model in a near-term quantum hardware. Practically, physical errors can be suppressed using recently proposed error mitigation methods. We then extend physical error mitigation methods to suppress the algorithmic error in Hamiltonian simulation. By exploiting the simulation results with different numbers of Trotter steps $N\le N_{\textrm{opt}}$, we can infer the exact simulation result within a higher accuracy and hence mitigate algorithmic errors. We numerically test our scheme with a five qubit system and show significant improvements in the simulation accuracy by applying both physical and algorithmic error mitigations.

quant-ph↗

arXiv2018

Device independent quantum random number generation

Randomness is critical for many information processing applications, including numerical modeling and cryptography. Device-independent quantum random number generation (DIQRNG) based on the loophole free violation of Bell inequality produces unpredictable genuine randomness without any device assumption and is therefore an ultimate goal in the field of quantum information science. However, due to formidable technical challenges, there were very few reported experimental studies of DIQRNG, which were vulnerable to the adversaries. Here we present a fully functional DIQRNG against the most general quantum adversaries. We construct a robust experimental platform that realizes Bell inequality violation with entangled photons with detection and locality loopholes closed simultaneously. This platform enables a continuous recording of a large volume of data sufficient for security analysis against the general quantum side information and without assuming independent and identical distribution. Lastly, by developing a large Toeplitz matrix (137.90 Gb $\times$ 62.469 Mb) hashing technique, we demonstrate that this DIQRNG generates $6.2469\times 10^7$ quantum-certified random bits in 96 hours (or 181 bits/s) with uniformity within $10^{-5}$. We anticipate this DIQRNG may have profound impact on the research of quantum randomness and information-secured applications.

quant-ph↗