We demonstrate quantum advantage with several basic assumptions, specifically based on only the existence of OWFs. We introduce inefficient-verifier proofs of quantumness (IV-PoQ), and construct it from classical bit commitments. IV-PoQ is an interactive protocol between a verifier and a quantum prover consisting of two phases. In the first phase, the verifier is probabilistic polynomial-time, and it interacts with the prover. In the second phase, the verifier becomes inefficient, and makes its decision based on the transcript of the first phase. If the prover is honest, the inefficient verifier accepts with high probability, but any classical malicious prover only has a small probability of being accepted by the inefficient verifier. Our construction demonstrates the following results: (1)If one-way functions exist, then IV-PoQ exist. (2)If distributional collision-resistant hash functions exist (which exist if hard-on-average problems in $\mathbf{SZK}$ exist), then constant-round IV-PoQ exist. We also demonstrate quantum advantage based on worst-case-hard assumptions. We define auxiliary-input IV-PoQ (AI-IV-PoQ) that only require that for any malicious prover, there exist infinitely many auxiliary inputs under which the prover cannot cheat. We construct AI-IV-PoQ from an auxiliary-input version of commitments in a similar way, showing that (1)If auxiliary-input one-way functions exist (which exist if $\mathbf{CZK}\not\subseteq\mathbf{BPP}$), then AI-IV-PoQ exist. (2)If auxiliary-input collision-resistant hash functions exist (which is equivalent to $\mathbf{PWPP}\nsubseteq \mathbf{FBPP}$) or $\mathbf{SZK}\nsubseteq \mathbf{BPP}$, then constant-round AI-IV-PoQ exist.
In TCSS (Threshold Changeable Secret Sharing) scheme, the threshold can be changed to deal with share leakage in the long term. But in classical TCSS, there is no guarantee that old shares are deleted even if the participated parties are honest. So, the changed threshold may not prevent an adversary from reconstructing the secret by the old shares and old threshold number of parties. We show how to tackle this problem quantum mechanically. I.e., quantum mechanically we can make the changed threshold mandatory. So, there is quantum advantage of quantum TCSS over classical TCSS.
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n^2), where n = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity offers the possibility to already explore and showcase this advantage for useful tasks. Here, we define such a task, the Sampling Matching problem, which is inspired by the Hidden Matching problem and features an exponential gap between quantum and classical protocols in the one-way communication model. Our problem allows by its conception a photonic implement…
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers in approximating solutions to many NP optimization problems. This observation however gives nothing in practice.
Quantum information advantage based on Bell inequalities
Centre for Quantum Technologies, Quantum Computing Research Centre, Department of Computer Science, Hon Hai (Foxconn) Research Institute National University of Singapore（新加坡国立大学鸿海（富士康）研究院量子计算研究中心量子技术中心计算机科学系）
We discuss the realization of quantum advantage in a system without quantum entanglement but with non-zero quantum discord. We propose an optical realization of symmetric two-qubit $X$-states with controllable anti-diagonal elements. This approach does not requires initially entangled states, and it can generate states that have quantum discord, with or without entanglement. We discuss how quantum advantage can be attained in the context of a two-qubit game. We show that when entanglement is not present, the maximum quantum advantage is 1/3 bit. A comparable quantum advantage, 0.311 bit, can b…
Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
Indian Statistical Institute（印度统计研究所）；S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）；HUN-REN Institute for Nuclear Research（匈牙利研究与教育网络核物理研究所）；Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute（哈瑞斯昌德拉研究所，霍米·巴巴国立学院成员机构）；Okinawa Institute of Science and Technology Graduate University（冲绳科学技术大学院大学）；Indian Institute of Technology Goa（果阿印度理工学院）
We introduce a quantum algorithm for efficient biased sampling of the rare events generated by classical memoryful stochastic processes. We show that this quantum algorithm gives an extreme advantage over known classical biased sampling algorithms in terms of the memory resources required. The quantum memory advantage ranges from polynomial to exponential and when sampling the rare equilibrium configurations of spin systems the quantum advantage diverges.
It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all $n$-bit Boolean functions can be computed by an exact quantum algorithm with less than $n$ queries. More exactly, we prove that ${AND}_n$ is the only $n$-bit Boolean function, up to isomorphism, that requires $n$ queries.
Simons Institute for the Theory of Computing, University of California at Berkeley（加州大学伯克利分校西蒙斯理论计算研究所）；Institute for Theoretical Physics, ETH Zürich（苏黎世联邦理工学院理论物理研究所）
Random access codes have provided many examples of quantum advantage in communication, but concern only one kind of information retrieval task. We introduce a related task - the Torpedo Game - and show that it admits greater quantum advantage than the comparable random access code. Perfect quantum strategies involving prepare-and-measure protocols with experimentally accessible three-level systems emerge via analysis in terms of the discrete Wigner function. The example is leveraged to an operational advantage in a pacifist version of the strategy game Battleship. We pinpoint a characteristic …
Many quantum mechanical experiments can be viewed as multi-round interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum "coherent" access to the unknown process is known to provide an advantage in many discrimination tasks compared to when only incoherent access is permitted, but it is unclear if this advantage persists when the process is noisy. Here, we show that a quantum advantage can be maintained when distinguishing between two noisy single qubit rotation channels. Numerical and analytical calculations reveal a distinct transition between optim…
The quantum advantage threshold determines when a quantum processing unit (QPU) is more efficient with respect to classical computing hardware in terms of algorithmic complexity. The "green" quantum advantage threshold $-$ based on a comparison of energetic efficiency between the two $-$ is going to play a fundamental role in the comparison between quantum and classical hardware. Indeed, its characterization would enable better decisions on energy-saving strategies, e.g. for distributing the workload in hybrid quantum-classical algorithms. Here, we show that the green quantum advantage thresho…
We investigate the problem of simulating classical stochastic processes through quantum dynamics, and present three scenarios where memory or time quantum advantages arise. First, by introducing and analysing a quantum version of the embeddability problem for stochastic matrices, we show that quantum memoryless dynamics can simulate classical processes that necessarily require memory. Second, by extending the notion of space-time cost of a stochastic process $P$ to the quantum domain, we prove an advantage of the quantum cost of simulating $P$ over the classical cost. Third, we demonstrate tha…
Towards Quantum Advantage in Sparsified Bosonic SYK Models
Kavli IPMU (WPI), UTIAS, The University of Tokyo（东京大学）；IBM Quantum, IBM Research—Tokyo（IBM研究-东京）；Graduate School of Physics, University of Tokyo（东京大学）；Trans-Scale Quantum Science Institute, University of Tokyo（东京大学）；Center for Data-Driven Discovery (CD3), Kavli IPMU, University of Tokyo（东京大学）
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement realized in such a demonstration be quantified? Inspired by the area law of tensor networks, we derive an upper bound for the minimum random circuit depth needed to generate the maximal bipartite entanglement correlations between all problem variables (qubits). This bound is (i) lattice geometry dependent and (ii) makes explicit a nuance implicit in other prop…
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that type of problems and non-signaling correlations. We construct non linear bipartite Bell type inequalities and strong nonlocality test with binary observables by providing general method of Bell inequalities construction and showing that existence of gap between quantum and classical complexity leads to violation of these inequalities. We obtain, first to our…
The advantage of using a single-photon two-mode entangled state in two-way communication via maximal violation of an inequality associated with the `Guess Your Neighbour's Input' (GYNI) game has been theoretically [Phys. Rev. Lett. 120, 060503 (2018)] as well as experimentally [CLEO FID.4 (OSA, 2018)] established quite recently. We show that such an advantage can also be obtained using any single-mode pure non-classical state embedded in a two-mode pure entangled state, wherein the other mode is the vacuum (henceforth referred to as a generalized NOON state), regardless of the average photon n…
We examined the possibility of recovering the losses of entanglement and the non-local advantage by using the local symmetric operations. The improvement efficiency may be increased by applying the symmetric operations on both qubits. The recovering process of both phenomenon is exhibited clearly when only one qubit is accelerated and the symmetric operations is applied on both qubits. It is shown that, for large acceleration, the non-local coherent advantage may be re-birthed by using these symmetric operations.
Entanglement-induced provable and robust quantum learning advantages
Center for Quantum Information, IIIS, Tsinghua University, Beijing 100084, China（清华大学信息科学与技术研究院量子信息中心）；Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125, USA（加州理工学院量子信息与物质研究所）；Hefei National Laboratory, Hefei 230088, PR China（合肥国家实验室）；Shanghai Qi Zhi Institute, Shanghai 200232, China（上海启智研究所）
It is known that advantage distillation (that is, information reconciliation using two-way communication) improves noise tolerances for quantum key distribution (QKD) setups. Two-way communication is hence also of interest in the device-independent case, where noise tolerance bounds for one-way error correction are currently too low to be experimentally feasible. Existing security proofs for the device-independent repetition-code protocol (the most prominent form of advantage distillation) rely on fidelity-related security conditions, but previous bounds on the fidelity were not tight. We impr…
Nanjing University（南京大学）；MatricTime Digital Technology Co. Ltd.（矩阵时光数字科技有限公司）
An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes experimentally continues to be a central challenge because of the difficulty in preparing high-dimensional states or highly entangled states. In this study, we introduce and analyse a quantum coupon collector protocol by employing coherent states and simple linear optical elements, which was successfully demonstrated using realistic experimental equipment. We showed that…
Classical stochastic processes can be generated by quantum simulators instead of the more standard classical ones, such as hidden Markov models. One reason for using quantum simulators is that they generally require less memory than their classical counterparts. Here, we examine this quantum advantage for strongly coupled spin systems---the Dyson-like one-dimensional Ising spin chain with variable interaction length. We find that the advantage scales with both interaction range and temperature, growing without bound as interaction increases. Thus, quantum systems can very efficiently simulate …
The last two decades have witnessed a rapid development of quantum information processing, a new paradigm which studies the power and limit of "quantum advantages" in various information processing tasks. Problems such as when quantum advantage exists, and if existing, how much it could be, are at a central position of these studies. In a broad class of scenarios, there are, implicitly or explicitly, at least two parties involved, who share a state, and the correlation in this shared state is the key factor to the efficiency under concern. In these scenarios, the shared \emph{entanglement} or …
