arXiv:1703.00656

Interplay between Quantumness, Randomness, and Selftesting

Xiao Yuan

Published Mar 2, 2017• 0 citations

Abstract

Quantum information processing shows advantages in many tasks, including quantum communication and computation, comparing to its classical counterpart. The essence of quantum processing lies on the fundamental difference between classical and quantum states. For a physical system, the coherent superposition on a computational basis is different from the statistical mixture of states in the same basis. Such coherent superposition endows the possibility of generating true random numbers, realizing parallel computing, and other classically impossible tasks such as quantum Bernoulli factory. Considering a system that consists of multiple parts, the coherent superposition that exists nonlocally on different systems is called entanglement. By properly manipulating entanglement, it is possible to realize computation and simulation tasks that are intractable with classical means. Investigating quantumness, coherent superposition, and entanglement can shed light on the original of quantum advantages and lead to the design of new quantum protocols. This thesis mainly focuses on the interplay between quantumness and two information tasks, randomness generation and selftesting quantum information processing. We discuss how quantumness can be used to generate randomness and show that randomness can in turn be used to quantify quantumness. In addition, we introduce the Bernoulli factory problem and present the quantum advantage with only coherence in both theory and experiment. Furthermore, we show a method to witness entanglement that is independent of the realization of the measurement. We also investigate randomness requirements in selftesting tasks and propose a random number generation scheme that is independent of the randomness source.

DOI: 10.48550/arxiv.1703.00656

Related papers

Experimental Quantum Randomness Processing Using Superconducting Qubits

Xiao Yuan, Ke Liu, Yuan Xu +7 more

Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such as entanglement. Recently, Dale, Jennings, and Rudolph negated the question by showing that a randomness processing, quantum Bernoulli factory, using quantum coherence, is strictly more powerful than the one with classical mechanics. In this Letter, focusing on the same scenario, we propose a theoretical protocol that is classically impossible but can be implemented solely using quantum coherence without entanglement. We demonstrate the protocol by exploiting the high-fidelity quantum state preparation and measurement with a superconducting qubit in the circuit quantum electrodynamics architecture and a nearly quantum-limited parametric amplifier. Our experiment shows the advantage of using quantum coherence of a single qubit for information processing even when multipartite correlation is not present.

arXiv:1607.00610Physical Review LettersJun 29, 201624 citations

An experimental quantum Bernoulli factory

Raj B. Patel, Terry Rudolph, Geoff J. Pryde

There has been a concerted effort to identify problems computable with quantum technology, which are intractable with classical technology or require far fewer resources to compute. Recently, randomness processing in a Bernoulli factory has been identified as one such task. Here, we report two quantum photonic implementations of a Bernoulli factory, one using quantum coherence and single-qubit measurements and the other one using quantum coherence and entangling measurements of two qubits. We show that the former consumes three orders of magnitude fewer resources than the best-known classical method, while entanglement offers a further fivefold reduction. These concepts may provide a means for quantum-enhanced performance in the simulation of stochastic processes and sampling tasks.

arXiv:1807.04297Science AdvancesJan 4, 201913 citations

Quantum coins and quantum sampling

Howard Dale

Quantum computing is rapidly becoming one of the largest research areas in quantum physics and yet we are still unable to prove the superiority of quantum computing over classical with the exception of a few contrived and unrealistic scenarios. Understanding the areas in which quantum computing provides an advantage and, more importantly, where that advantage comes from is the key to making progress in the field. We certainly do not solve this mystery in this thesis but do explore some unconventional routes through which answers may be found in the future. To this end we explore quantum advantage in a different computational setting. Rather than working with Turing Machines as most research does, we focus on the Bernoulli Factory: a randomness processing scheme studied in the fields of statistics and computer science. The Bernoulli Factory takes an infinite string of random bits generated with a fixed unknown bias as input and outputs a single random bit, the bias of which is a function of the input bias. This can be seen more intuitively as generating one biased coin from another, given a desired relationship between the two biases. The Bernoulli Factory is inherently probabilistic, like quantum mechanics, and so, it leads us to questions about the fundamental nature of quantum randomness and quantum sampling. We find, as we hoped, that the Bernoulli Factory is more tractable than the Turing Machine and that we are able to prove quantum superiority in both resource efficiency and classes of computable functions. We first give the quantum analogue of the classical Keane-O'’Brien theorem which establishes the increased class of computable functions for the quantum case. We then adjust the problem in a variety of ways, such as introducing multiple coins, errors in state preparation, phases and restriction on the bias or operations allowed. These lead to additional results which lend insight into the problems faced in quantum computing as well as the nature of quantum randomness.

Sep 1, 20160 citations

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

Jiajun Ma, Aishwarya Hakande, Xiao Yuan +1 more

Measuring quantum states provides a means to generate genuine random numbers. It has been shown that genuine randomness can be obtained even with an uncharacterized source by measuring two incompatible bases [Phys. Rev. X 6, 011020 (2016)]. As coherence is the necessary source for generating randomness, we extend the scheme and propose a framework for quantum random number generation with general uncharacterized coherence resource. The previous scheme can be treated as a special case under the framework by considering a nonlinear uncertainty-relation-based coherence witness. Considering general coherence witnesses, we propose a source-independent random-number generation scheme that achieves a higher randomness generation rate. Our paper highlights the close relation between coherence and random-number generation and may shed light on designing general semi-device-independent quantum information processing protocols.

arXiv:1704.06915Physical Review AFeb 25, 201926 citations

Foundations of quantum theory and quantum information applications

Ernesto F. Galvão

This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement characterisation, and of a few quantum information protocols. Quantum non-locality and contextuality are shown to be essential for different implementations of quantum information protocols known as quantum random access codes and quantum communication complexity protocols. I derive sufficient experimental conditions for tests of these quantum properties. I also discuss how the distribution of quantum information through quantum cloning processes can be useful in quantum computing. Regarding entanglement characterisation, some results are obtained relating two problems, that of additivity of the relative entropy of entanglement, and that of identifying different types of tripartite entanglement in the asymptotic regime of manipulations of many copies of a given state. The thesis ends with a description of an information processing task in which a single qubit substitutes for an arbitrarily large amount of classical communication. This result is interpreted in different ways: as a gap between quantum and classical computation space complexity; as a bound on the amount of classical communication necessary to simulate entanglement; and as a basic result on hidden-variable theories for quantum mechanics. I also show that the advantage of quantum over classical communication can be established in a feasible experiment.

arXiv:quant-ph/0212124Dec 22, 200225 citations

Advances in quantum key distribution and quantum randomness generation

Lê Phuc Thinh

Quantum information science has completely changed the way we think about and process information. From the simple realization that information is physical, we have been able to use the peculiar features of quantum mechanical phenomena to our advantage. Designing algorithms whose performance exceeds those running on classical computers, and performing secret communication whose security can actually be proven from sound assumptions are two main catalysts for the establishment of the field. This thesis discusses some progress in quantum key distribution and quantum randomness generation. Quantum key distribution, which is motivated by the increasing need to communicate securely, is on the verge of becoming an established technology. With the goal of extending the reach of quantum key distribution to more realistic scenarios, we present a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years. This allows these protocols to be used in practice against the most general adversary, although the key rate is rather pessimistic. In quantum randomness generation, the amount of extractable randomness from a quantum system depends on the level of trust or characterization of the devices; we present a study into such interaction. In the extreme situation of distrust, i.e. device-independent scenarios, we study the effect of the input randomness on the certifying power of such scenarios, and realize that one cannot amplify an arbitrary min-entropy source device-independently. Finally we discuss the amount of randomness in post-selected data, which has consequences on practical randomness generation protocols. The in depth study of randomness generation from quantum processes is well justified by the important role of randomness in modern computer science and other fields.

Jan 1, 20150 citations