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.

Randomness is critical for many information processing applications, including numerical modeling and cryptography [1,2]. Device-independent quantum random number generation [3] (DIQRNG) based on the loophole free violation of Bell inequality [4][5][6][7] produces unpredictable genuine randomness without any device assumption and is therefore an ultimate goal in the field of quantum information science [8][9][10]. However, due to formidable technical challenges, there were very few reported experimental studies of DIQRNG [11][12][13][14], which were vulnerable to the adversaries. Here we present a fully functional DIQRNG against the most general quantum adversaries [15][16][17]. 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 × 62.469 Mb) hashing technique, we demonstrate that this DIQRNG generates 6.2469 × 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.

The decoy-state scheme is the most widely implemented quantum-key-distribution protocol in practice. In order to account for the finite-size key effects on the achievable secret key generation rate, a rigorous statistical fluctuation analysis is required. Originally, a heuristic Gaussian-approximation technique was used for this purpose, which, despite its analytical convenience, was not sufficiently rigorous. The fluctuation analysis has recently been made rigorous by using the Chernoff bound. There is a considerable gap, however, between the key-rate bounds obtained from these techniques and that obtained from the Gaussian assumption. Here we develop a tighter bound for the decoy-state method, which yields a smaller failure probability. This improvement results in a higher key rate and increases the maximum distance over which secure key exchange is possible. By optimizing the system parameters, our simulation results show that our method almost closes the gap between the two previously proposed techniques and achieves a performance similar to that of conventional Gaussian approximations.

Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds-security and practicality, constitutes an appealing solution to secure metropolitan communications.

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 nonasymptotic 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.

Purpose -The objective of this study is to modify the SERVPERF scale by incorporating the additional dimension of recoverability, and to empirically test and refine the modified SERVPERF instrument using survey data from China. The study aims to assess the potential antecedents of customer satisfaction in the fast food industry in China. The antecedents include service quality, food quality, and perceived value. Finally, it seeks to examine the relationship between behavioral intentions and customer satisfaction in the fast food industry in mainland China. Design/methodology/approach -A survey was used to evaluate customer perceptions of the service quality in fast-food restaurants (FFRs). Exploratory factor analysis and confirmatory factor analysis were used to assess the reliability and validity of the modified Chinese FFR SERVPERF instrument. Structural equation modeling was employed to assess the hypothesized relationships. Findings -Reliability, recoverability, tangibles, and responsiveness were all significant dimensions of perceived service quality. Food quality, perceived value and service quality all had a direct and positive relationship with satisfaction, which in turn influenced behavioral intentions. Originality/value -Western-style fast food franchises are increasingly crossing national boundaries and looking for growth among customers in China. China is becoming a major player in the global market because of its size and growth potential, particularly after its accession to the World Trade Organization. The transference of a western business model is not appropriate in the context of China without testing because of dietary and cultural differences. The study modified the SERVPERF instrument and empirically validated the instrument using data from China. The results contribute to the understanding of service quality in China's fast food industry and provide insight about service management and improvement opportunities in Chinese service operations.

Quantum mechanics provides means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a self-testing manner that is independent of implementation devices. Here, we present an experimental demonstration of self-testing quantum random number generation based on an detection-loophole free Bell test with entangled photons. In the randomness analysis, without the assumption of independent identical distribution, we consider the worst case scenario that the adversary launches the most powerful attacks against quantum adversary. After considering statistical fluctuations and applying an 80 Gb × 45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits/s, with a failure probability less than 10 −5 . Such self-testing random number generators mark a critical step towards realistic applications in cryptography and fundamental physics tests. 2Introduction.-Random numbers are widely used in applications ranging from numerical

The resource framework of quantum coherence was introduced by Baumgratz, Cramer and Plenio [Phys. Rev. Lett. 113, 140401 (2014)] and further developed by Winter and Yang [Phys. Rev. Lett. 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. [Phys. Rev. Lett. 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., Phys. Rev. Lett. 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.[9], [10], [11]. Recently, a resource theory framework of quantum coherence has been introduced by Baumgratz, Cramer and Plenio [12] (after prior work ofÅberg [13], as well as Braun and Georgeot [14]). A general quantum resource theory consists of two objects: a set of free states and a set of free operations, with the latter acting invariantly on the former. In