DOCSLIB.ORG

Insolubilitщ En Абв De L'щquation Ге ¤ Жизйг

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Insolubilitщ En Абв De L'щquation Ге ¤ Жизйг 5. E. Bernstein and U. Vazirani, ªQuantum complexity 20. A. K. Lenstra and H. W. Lenstra, Jr., eds., The Devel- theory,º in Proc. 25th ACM Symp. on Theory of Com- opment of the Number Field Sieve, Lecture Notes in putating, pp. 11±20 (1993). Mathematics No. 1554, Springer-Verlag (1993); this 6. A. Berthiaume and G. Brassard, ªThe quantum chal- book contains reprints of the articles that were critical lenge to structural complexity theory,º in Proc. 7th in the development of the fastest known factoring al- Conf. on Structure in Complexity Theory, IEEE Com- gorithm. puter Society Press, pp. 132±137 (1992). 21. H. W. Lenstra, Jr. and C. Pomerance, ªA rigorous 7. A. Berthiaume and G. Brassard, ªOracle quantum time bound for factoring integers,º J. Amer. Math. Soc. computing,º in Proc. Workshop on Physics and Com- Vol. 5, pp. 483±516 (1992). putation, pp. 195±199, IEEE Computer Society Press 22. S. Lloyd, ªA potentially realizable quantum com- (1992). puter,º Science, Vol. 261, pp. 1569±1571 (1993). 8. D. Coppersmith, ªAn approximate Fourier transform 23. S. Lloyd, ªEnvisioning a quantum supercomputer,º useful in quantum factoring,º IBM Research Report Science, Vol. 263, p. 695 (1994). RC 19642 (1994). 24. G. L. Miller, ªRiemann's hypothesis and tests for 9. D. Deutsch, ªQuantum theory, the Church±Turing primality,º J. Comp. Sys. Sci. Vol. 13, pp. 300±317 principle and the universal quantum computer,º Proc. (1976). Roy. Soc. Lond. Ser. A, Vol. 400, pp. 96±117 (1985). 25. S. Pohligand M. Hellman, ªAn improved algorithm for 10. D. Deutsch, ªQuantum computing discrete logarithms over GF(p) and its cryp- computational networks,º Proc. Roy. Soc. Lond. Ser. A, tographic signi®cance,º IEEE Trans. Information The- Vol. 425, pp. 73±90 (1989). ory, Vol. 24, pp. 106±110 (1978). 11. D. Deutsch and R. Jozsa, ªRapid solution of problems 26. C. Pomerance, ªFast, rigorous factoriza- by quantum computation,º Proc. Roy. Soc. Lond. Ser. tion and discrete logarithm algorithms,º in Discrete Al- A Vol. 439, pp. 553±558 (1992). gorithms and Complexity (Proc. Japan-US Joint Sem- 12. D. P. DiVincenzo, ªTwo-bit gates are univer- inar), pp. 119-143, Academic Press (1986). sal for quantum computation,º Phys. Rev. A, Vol. 51, 27. R. L. Rivest, A. Shamir, and L. Adleman ªA method of pp. 1015±1022 (1995). obtaining digital signatures and public-key cryptosys- 13. R. Feynman, ªSimulating physics with computers,º In- tems,º CommunicationsACM, Vol. 21, No. 2, pp. 120± ternational Journal of Theoretical Physics, Vol. 21, 126 (1978). No. 6/7, pp. 467±488 (1982). 28. A. Shamir, ªIP ¤ PSPACE,º in Proc. 31th Ann. Symp. 14. R. Feynman, ªQuan- on Foundations of Computer Science, pp. 11±15, IEEE tum mechanical computers,º Foundations of Physics, Computer Society Press (1990). Vol. 16, pp. 507±531 (1986). (Originally appeared in 29. D. Simon, ªOn the power of quantum computation,º Optics News, February 1985.) in Proc. 35th Ann. Symp. on Foundations of Computer 15. L. Fortnow and M. Sipser, ªAre there interactive proto- Science, pp. 116±123, IEEE Computer Society Press cols for co-NP languages?º Inform. Proc. Lett. Vol. 28, (1994). pp. 249±251 (1988). 30. W. G. Teich, K. Obermayer, and G. Mahler, ªStruc- 16. D. M. Gordon, ªDiscrete logarithms in GF(p) using the tural basis of multistationary quantum systems II: Ef- number ®eld sieve,º SIAM J. Discrete Math. Vol. 6, fective few-particle dynamics,º Phys. Rev. B, Vol. 37, pp. 124±139 (1993). pp. 8111±8121 (1988). 17. G. H. Hardy and E. M. Wright, An Introduction to the 31. T. Toffoli, ªReversible computing,º in Automata, Lan- Theory of Numbers, Fifth Edition, Oxford University guages and Programming, Seventh Colloq., Lecture Press, New York (1979). Notes in Computer Science No. 84 (J. W. De Bakker 18. R. Landauer, ªIs quantum mechanically coherent com- and J. van Leeuwen, eds.) pp. 632-644, Springer- putation useful?º in Proceedings of the Drexel-4 Verlag (1980). Symposium on Quantum Nonintegrability Ð Quantum 32. W. G. Unruh, ªMaintaining coherence in quantum Classical Correspondence (D. H. Feng and B-L. Hu, computers,º Phys. Rev. A, Vol. 51, pp. 992±997 (1995). eds.) International Press, to appear. 33. A. Yao, ªQuantum circuit complexity,º in Proc. 34th 19. Y. Lecerf, ªMachines de Turing reversibles. Recursive Ann. Symp. on Foundations of Computer Science, ¡ ¢ pp. 352±361, IEEE Computer Society Press (1993). ¦¨§©£ insolubilite en de l'equation £¥¤ , ouÁ ¦ est un isomorphisme de codes,º Comptes Ren- dues de l'Academie FrancËaise des Sciences, Vol. 257, pp. 2597-2600 (1963). 11 D where this equation was obtained from Condition (7.34) by further increase of D by 1; thus for some large constant it ¥2T dividing by . The ®rst thing to notice is that the multi- is less than . ¡ ¢¤£¦¥ § plier on is a fraction with denominator , since Recall that each good ( is obtained with probability at §©¨ ¢ £ ¥ £§©¨ ¢£¥ %¥©C evenly divides . Thus, we need only least ¥©%¥©7 from any experiment. Since there are ¥¨¢£¥ § ¥7CD round off to the nearest multipleof and divide good ( 's, after experiments, we are likely to obtain ¨! #"%$&¢£'¥© D § by a sample of good ( 's chosen equally likely from all good § § ( ( 's. Thus, we will be able to ®nd a set of 's such that all §©¨ ¢£¥ *£+§©¨¢£'¥ ? 5'TC ¢ ¢V£+¥ = < ©¤ §)( (7.40) prime powers dividing are relatively prime ? § ¢ to at least one of these ( 's. For each prime less than 20, to ®nd a candidate ¡ . To show that this experiment need we thus have at most 20 possibilities for the residue mod- ? ? ? ¢ W ¢ only be repeated a polynomial number of times to ®nd the ulo <%= , where is the exponent on prime in the prime factorization of ¢#£@¥ . We can thus try all possibilites for correct ¡ requires only a few more details. The problem is again that we cannot divide by a number which is not rela- residues modulo powers of primes less than 20: for each ¡ tively prime to ¢£¥ . possibility we can calculate the corresponding using the For the general case of the discrete log algorithm, we Chinese remainder theorem, and then check to see whether § it is the desired discrete logarithm. do not know that all possible values of ( are generated with reasonable likelihood; we only know this about one- This algorithm does not use very many properties of XZY , tenth of them. This additional dif®culty makes the next step so we can use the same algorithmto ®nd discrete logarithms [\Y harder than the corresponding step in the two previous al- over other ®elds such as G . What we need is that we gorithms. If we knew the remainder of ¡ modulo all prime know the order of the generator, and that we can multiply and take inverses of elements in polynomial time. powers dividing ¢#£,¥ , we could use the Chinese remain- der theorem to recover ¡ in polynomial time. We will only If one were to actually program this algorithm (which be able to ®nd this remainder for primes larger than 20, but must wait until a quantum computer is built) there are many with a little extra work we will still be able to recover ¡ . ways in which the ef®ciency could be increased over the ef- What we have is that each good ¨-§.) pair is generated ®ciency shown in this paper. with probability at least / ¥0213¢4 65,¥%¥©7 , and that at least ¨-§.) a tenth of the possible § 's are in a good pair. From Acknowledgements §32 Eq. (7.40), it follows that these § 's are mapped from to § ¨ ¢ £8¥© ( by rounding to the nearest integer multiple of I would like to thank Jeff Lagarias for ®nding and ®x- § ¥¨¢9£+¥ . Further, the good 's are exactly those in which ing a critical bug in the ®rst version of the discrete log al- §32 § ¨¢:£;¥ § is close to ( . Thus, each good corresponds gorithm. I would also like to thank him, Charles Bennett, § with exactly one ( . We would like to show that for any Gilles Brassard, Andrew Odlyzko, Dan Simon, Umesh ? ¢4<>= ¢£@¥ § prime power dividing , a random good ( is un- Vazirani, as well as other correspondents too numerous to ? likely to contain ¢ . If we are willing to accept a large con- list, for productive discussions, for corrections to and im- stant for the algorithm, we can just ignore the prime powers provements of early drafts of this paper, and for pointers to under 20; if we know ¡ modulo all prime powers over 20, the literature. we can try all possible residues for primes under 20 with only a (large) constant factor increase in running time. Be- References ¨A§.B cause at least one tenth of the § 's were in a good pair, § at least one tenth of the ( 's are good. Thus, for a prime 1. P. Benioff, ªQuantum mechanical Hamiltonian models ? ? ¢ § ¢ = = < < power , a random good ( is divisible by with proba- of Turing machines,º J. Stat. Phys. Vol. 29, pp. 515± ? ¥©C3¢ D § = < bilityat most . If we have good ( 's, the probability 546 (1982). of having a prime power over 20 that divides all of them is 2. P. Benioff, ªQuantum mechanical Hamiltonian mod- therefore at most els of Turing machines that dissipate no energy,º Phys. P Rev. Lett. Vol. 48, pp. 1581±1585 (1982). E ¥C . (7.41) 3. C. H. Bennett, ªLogical reversibility of computation,º ?+Q6R ¢ <>= FAG IBM J. Res. Develop. Vol. 17, pp. 525±532 (1973). = =HI!J G FNMO F 4. C. H. Bennett, E. Bernstein, G. Brassard and U. Vazi- = =LK rani, ªStrengths and weaknesses of quantum comput- where the sum is over all prime powers greater than 20 that ing,º manuscript (1994).
Load more

Recommended publications
  • Simulating Quantum Field Theory with a Quantum Computer
    Simulating quantum field theory with a quantum computer John Preskill Lattice 2018 28 July 2018 This talk has two parts (1) Near-term prospects for quantum computing. (2) Opportunities in quantum simulation of quantum field theory. Exascale digital computers will advance our knowledge of QCD, but some challenges will remain, especially concerning real-time evolution and properties of nuclear matter and quark-gluon plasma at nonzero temperature and chemical potential. Digital computers may never be able to address these (and other) problems; quantum computers will solve them eventually, though I’m not sure when. The physics payoff may still be far away, but today’s research can hasten the arrival of a new era in which quantum simulation fuels progress in fundamental physics. Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime particle collision molecular chemistry entangled electrons A quantum computer can simulate efficiently any physical process that occurs in Nature. (Maybe. We don’t actually know for sure.) superconductor black hole early universe Two fundamental ideas (1) Quantum complexity Why we think quantum computing is powerful. (2) Quantum error correction Why we think quantum computing is scalable. A complete description of a typical quantum state of just 300 qubits requires more bits than the number of atoms in the visible universe. Why we think quantum computing is powerful We know examples of problems that can be solved efficiently by a quantum computer, where we believe the problems are hard for classical computers.
    [Show full text]
  • Quantum Computer: Quantum Model and Reality
    Quantum Computer: Quantum Model and Reality Vasil Penchev, [email protected] Bulgarian Academy of Sciences: Institute of Philosophy and Sociology: Dept. of Logical Systems and Models Abstract. Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical processes represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformations. Key words: model, quantum computer, reality, Turing machine Eight questions: There are a few most essential questions about the philosophical interpretation of quantum computer. They refer to the fundamental problems in ontology and epistemology rather than philosophy of science or that of information and computation only. The contemporary development of quantum mechanics and the theory of quantum information generate them.
    [Show full text]
  • Quantum Machine Learning: Benefits and Practical Examples
    Quantum Machine Learning: Benefits and Practical Examples Frank Phillipson1[0000-0003-4580-7521] 1 TNO, Anna van Buerenplein 1, 2595 DA Den Haag, The Netherlands [email protected] Abstract. A quantum computer that is useful in practice, is expected to be devel- oped in the next few years. An important application is expected to be machine learning, where benefits are expected on run time, capacity and learning effi- ciency. In this paper, these benefits are presented and for each benefit an example application is presented. A quantum hybrid Helmholtz machine use quantum sampling to improve run time, a quantum Hopfield neural network shows an im- proved capacity and a variational quantum circuit based neural network is ex- pected to deliver a higher learning efficiency. Keywords: Quantum Machine Learning, Quantum Computing, Near Future Quantum Applications. 1 Introduction Quantum computers make use of quantum-mechanical phenomena, such as superposi- tion and entanglement, to perform operations on data [1]. Where classical computers require the data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits, which can be in superpositions of states. These computers would theoretically be able to solve certain problems much more quickly than any classical computer that use even the best cur- rently known algorithms. Examples are integer factorization using Shor's algorithm or the simulation of quantum many-body systems. This benefit is also called ‘quantum supremacy’ [2], which only recently has been claimed for the first time [3]. There are two different quantum computing paradigms.
    [Show full text]
  • COVID-19 Detection on IBM Quantum Computer with Classical-Quantum Transfer Learning
    medRxiv preprint doi: https://doi.org/10.1101/2020.11.07.20227306; this version posted November 10, 2020. The copyright holder for this preprint (which was not certified by peer review) is the author/funder, who has granted medRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY-NC-ND 4.0 International license . Turk J Elec Eng & Comp Sci () : { © TUB¨ ITAK_ doi:10.3906/elk- COVID-19 detection on IBM quantum computer with classical-quantum transfer learning Erdi ACAR1*, Ihsan_ YILMAZ2 1Department of Computer Engineering, Institute of Science, C¸anakkale Onsekiz Mart University, C¸anakkale, Turkey 2Department of Computer Engineering, Faculty of Engineering, C¸anakkale Onsekiz Mart University, C¸anakkale, Turkey Received: .201 Accepted/Published Online: .201 Final Version: ..201 Abstract: Diagnose the infected patient as soon as possible in the coronavirus 2019 (COVID-19) outbreak which is declared as a pandemic by the world health organization (WHO) is extremely important. Experts recommend CT imaging as a diagnostic tool because of the weak points of the nucleic acid amplification test (NAAT). In this study, the detection of COVID-19 from CT images, which give the most accurate response in a short time, was investigated in the classical computer and firstly in quantum computers. Using the quantum transfer learning method, we experimentally perform COVID-19 detection in different quantum real processors (IBMQx2, IBMQ-London and IBMQ-Rome) of IBM, as well as in different simulators (Pennylane, Qiskit-Aer and Cirq). By using a small number of data sets such as 126 COVID-19 and 100 Normal CT images, we obtained a positive or negative classification of COVID-19 with 90% success in classical computers, while we achieved a high success rate of 94-100% in quantum computers.
    [Show full text]
  • Restricted Versions of the Two-Local Hamiltonian Problem
    The Pennsylvania State University The Graduate School Eberly College of Science RESTRICTED VERSIONS OF THE TWO-LOCAL HAMILTONIAN PROBLEM A Dissertation in Physics by Sandeep Narayanaswami c 2013 Sandeep Narayanaswami Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy August 2013 The dissertation of Sandeep Narayanaswami was reviewed and approved* by the following: Sean Hallgren Associate Professor of Computer Science and Engineering Dissertation Adviser, Co-Chair of Committee Nitin Samarth Professor of Physics Head of the Department of Physics Co-Chair of Committee David S Weiss Professor of Physics Jason Morton Assistant Professor of Mathematics *Signatures are on file in the Graduate School. Abstract The Hamiltonian of a physical system is its energy operator and determines its dynamics. Un- derstanding the properties of the ground state is crucial to understanding the system. The Local Hamiltonian problem, being an extension of the classical Satisfiability problem, is thus a very well-motivated and natural problem, from both physics and computer science perspectives. In this dissertation, we seek to understand special cases of the Local Hamiltonian problem in terms of algorithms and computational complexity. iii Contents List of Tables vii List of Tables vii Acknowledgments ix 1 Introduction 1 2 Background 6 2.1 Classical Complexity . .6 2.2 Quantum Computation . .9 2.3 Generalizations of SAT . 11 2.3.1 The Ising model . 13 2.3.2 QMA-complete Local Hamiltonians . 13 2.3.3 Projection Hamiltonians, or Quantum k-SAT . 14 2.3.4 Commuting Local Hamiltonians . 14 2.3.5 Other special cases . 15 2.3.6 Approximation Algorithms and Heuristics .
    [Show full text]
  • A Functional Architecture for Scalable Quantum Computing
    A Functional Architecture for Scalable Quantum Computing Eyob A. Sete, William J. Zeng, Chad T. Rigetti Rigetti Computing Berkeley, California Email: feyob,will,[email protected] Abstract—Quantum computing devices based on supercon- ducting quantum circuits have rapidly developed in the last few years. The building blocks—superconducting qubits, quantum- limited amplifiers, and two-qubit gates—have been demonstrated by several groups. Small prototype quantum processor systems have been implemented with performance adequate to demon- strate quantum chemistry simulations, optimization algorithms, and enable experimental tests of quantum error correction schemes. A major bottleneck in the effort to devleop larger systems is the need for a scalable functional architecture that combines all thee core building blocks in a single, scalable technology. We describe such a functional architecture, based on Fig. 1. A schematic of a functional layout of a quantum computing system. a planar lattice of transmon and fluxonium qubits, parametric amplifiers, and a novel fast DC controlled two-qubit gate. kBT should be much less than the energy of the photon at the Keywords—quantum computing, superconducting integrated qubit transition energy ~!01. In a large system where supercon- circuits, computer architecture. ducting circuits are packed together, unwanted crosstalk among devices is inevitable. To reduce or minimize crosstalk, efficient I. INTRODUCTION packaging and isolation of individual devices is imperative and substantially improves the performance of the system. The underlying hardware for quantum computing has ad- vanced to make the design of the first scalable quantum Superconducting qubits are made using Josephson tunnel computers possible. Superconducting chips with 4–9 qubits junctions which are formed by two superconducting thin have been demonstrated with the performance required to electrodes separated by a dielectric material.
    [Show full text]
  • STRONGLY UNIVERSAL QUANTUM TURING MACHINES and INVARIANCE of KOLMOGOROV COMPLEXITY (AUGUST 11, 2007) 2 Such That the Aforementioned Halting Conditions Are Satisfied
    STRONGLY UNIVERSAL QUANTUM TURING MACHINES AND INVARIANCE OF KOLMOGOROV COMPLEXITY (AUGUST 11, 2007) 1 Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity Markus M¨uller Abstract—We show that there exists a universal quantum Tur- For a compact presentation of the results by Bernstein ing machine (UQTM) that can simulate every other QTM until and Vazirani, see the book by Gruska [4]. Additional rele- the other QTM has halted and then halt itself with probability one. vant literature includes Ozawa and Nishimura [5], who gave This extends work by Bernstein and Vazirani who have shown that there is a UQTM that can simulate every other QTM for necessary and sufficient conditions that a QTM’s transition an arbitrary, but preassigned number of time steps. function results in unitary time evolution. Benioff [6] has As a corollary to this result, we give a rigorous proof that worked out a slightly different definition which is based on quantum Kolmogorov complexity as defined by Berthiaume et a local Hamiltonian instead of a local transition amplitude. al. is invariant, i.e. depends on the choice of the UQTM only up to an additive constant. Our proof is based on a new mathematical framework for A. Quantum Turing Machines and their Halting Conditions QTMs, including a thorough analysis of their halting behaviour. Our discussion will rely on the definition by Bernstein and We introduce the notion of mutually orthogonal halting spaces and show that the information encoded in an input qubit string Vazirani. We describe their model in detail in Subsection II-B.
    [Show full text]
  • On the Simulation of Quantum Turing Machines
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 304 (2003) 103–128 www.elsevier.com/locate/tcs On the simulation ofquantum turing machines Marco Carpentieri Universita di Salerno, 84081 Baronissi (SA), Italy Received 20 March 2002; received in revised form 11 December 2002; accepted 12 December 2002 Communicated by G. Ausiello Abstract In this article we shall review several basic deÿnitions and results regarding quantum compu- tation. In particular, after deÿning Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation ofQuantum Turing Machines by means ofobvious computation is introduced. We give a full discussion ofthe simulation ofmultitape Quantum Turing Machines in a slight generalization of the class introduced by Bernstein and Vazirani. As main result we show that the Fisher-Pippenger technique can be used to give an O(tlogt) simulation ofa multi-tape Quantum Turing Machine by another belonging to the extended Bernstein and Vazirani class. This result, even ifregarding a slightly restricted class ofQuantum Turing Machines improves the simulation results currently known in the literature. c 2003 Published by Elsevier B.V. 1. Introduction Even ifthe present technology does consent realizing only very simple devices based on the principles ofquantum mechanics, many authors considered to be worth it ask- ing whether a theoretical model ofquantum computation could o:er any substantial beneÿts over the correspondent theoretical model based on the assumptions ofclas- sical physics. Recently, this question has received considerable attention because of the growing beliefthat quantum mechanical processes might be able to performcom- putation that traditional computing machines can only perform ine;ciently.
    [Show full text]
  • Experimental Kernel-Based Quantum Machine Learning in Finite Feature
    www.nature.com/scientificreports OPEN Experimental kernel‑based quantum machine learning in fnite feature space Karol Bartkiewicz1,2*, Clemens Gneiting3, Antonín Černoch2*, Kateřina Jiráková2, Karel Lemr2* & Franco Nori3,4 We implement an all‑optical setup demonstrating kernel‑based quantum machine learning for two‑ dimensional classifcation problems. In this hybrid approach, kernel evaluations are outsourced to projective measurements on suitably designed quantum states encoding the training data, while the model training is processed on a classical computer. Our two-photon proposal encodes data points in a discrete, eight-dimensional feature Hilbert space. In order to maximize the application range of the deployable kernels, we optimize feature maps towards the resulting kernels’ ability to separate points, i.e., their “resolution,” under the constraint of fnite, fxed Hilbert space dimension. Implementing these kernels, our setup delivers viable decision boundaries for standard nonlinear supervised classifcation tasks in feature space. We demonstrate such kernel-based quantum machine learning using specialized multiphoton quantum optical circuits. The deployed kernel exhibits exponentially better scaling in the required number of qubits than a direct generalization of kernels described in the literature. Many contemporary computational problems (like drug design, trafc control, logistics, automatic driving, stock market analysis, automatic medical examination, material engineering, and others) routinely require optimiza- tion over huge amounts of data1. While these highly demanding problems can ofen be approached by suitable machine learning (ML) algorithms, in many relevant cases the underlying calculations would last prohibitively long. Quantum ML (QML) comes with the promise to run these computations more efciently (in some cases exponentially faster) by complementing ML algorithms with quantum resources.
    [Show full text]
  • High Energy Physics Quantum Computing
    High Energy Physics Quantum Computing Quantum Information Science in High Energy Physics at the Large Hadron Collider PI: O.K. Baker, Yale University Unraveling the quantum structure of QCD in parton shower Monte Carlo generators PI: Christian Bauer, Lawrence Berkeley National Laboratory Co-PIs: Wibe de Jong and Ben Nachman (LBNL) The HEP.QPR Project: Quantum Pattern Recognition for Charged Particle Tracking PI: Heather Gray, Lawrence Berkeley National Laboratory Co-PIs: Wahid Bhimji, Paolo Calafiura, Steve Farrell, Wim Lavrijsen, Lucy Linder, Illya Shapoval (LBNL) Neutrino-Nucleus Scattering on a Quantum Computer PI: Rajan Gupta, Los Alamos National Laboratory Co-PIs: Joseph Carlson (LANL); Alessandro Roggero (UW), Gabriel Purdue (FNAL) Particle Track Pattern Recognition via Content-Addressable Memory and Adiabatic Quantum Optimization PI: Lauren Ice, Johns Hopkins University Co-PIs: Gregory Quiroz (Johns Hopkins); Travis Humble (Oak Ridge National Laboratory) Towards practical quantum simulation for High Energy Physics PI: Peter Love, Tufts University Co-PIs: Gary Goldstein, Hugo Beauchemin (Tufts) High Energy Physics (HEP) ML and Optimization Go Quantum PI: Gabriel Perdue, Fermilab Co-PIs: Jim Kowalkowski, Stephen Mrenna, Brian Nord, Aris Tsaris (Fermilab); Travis Humble, Alex McCaskey (Oak Ridge National Lab) Quantum Machine Learning and Quantum Computation Frameworks for HEP (QMLQCF) PI: M. Spiropulu, California Institute of Technology Co-PIs: Panagiotis Spentzouris (Fermilab), Daniel Lidar (USC), Seth Lloyd (MIT) Quantum Algorithms for Collider Physics PI: Jesse Thaler, Massachusetts Institute of Technology Co-PI: Aram Harrow, Massachusetts Institute of Technology Quantum Machine Learning for Lattice QCD PI: Boram Yoon, Los Alamos National Laboratory Co-PIs: Nga T. T. Nguyen, Garrett Kenyon, Tanmoy Bhattacharya and Rajan Gupta (LANL) Quantum Information Science in High Energy Physics at the Large Hadron Collider O.K.
    [Show full text]
  • A Quantum Computer Foundation for the Standard Model and Superstring Theories*
    A Quantum Computer Foundation for the Standard Model and SuperString Theories* By Stephen Blaha** * Excerpted from the book Cosmos and Consciousness by Stephen Blaha (1stBooks Library, Bloomington, IN, 2000) available from amazon.com and bn.com. ** Associate of the Harvard University Physics Department. ABSTRACT 1. SuperString Theory can naturally be based on a Quantum Computer foundation. This provides a totally new view of SuperString Theory. 2. The Standard Model of elementary particles can be viewed as defining a Quantum Computer Grammar and language. 3. A Quantum Computer can be represented in part as a second-quantized Fermi field. 4. A Quantum Computer in a certain limit naturally forms a Superspace upon which Supersymmetry rotations can be defined – a Continuum Quantum Computer. 5. A representation of Quantum Computers exists that is similar to Turing Machines - a Quantum Turing Machine. As part of this development we define various types of Quantum Grammars. 6. High level Quantum Computer languages are described for the first time. New linguistic views of the most fundamental theories of Physics, the Standard Model and SuperString Theory are described. In these new linguistic representations particles become literally symbols or letters, and particle interactions become grammar rules. This view is NOT the same as the often-expressed view that Mathematics is the language of Physics. The linguistic representation is a specific new mathematical construct. We show how to create a SuperString Quantum Computer that naturally provides a framework for SuperStrings in general and heterotic SuperStrings in particular. There are also a number of new developments relating to Quantum Computers and Quantum Turing Machines that are of interest to Computer Science.
    [Show full text]
  • Quantum Computing : a Gentle Introduction / Eleanor Rieffel and Wolfgang Polak
    QUANTUM COMPUTING A Gentle Introduction Eleanor Rieffel and Wolfgang Polak The MIT Press Cambridge, Massachusetts London, England ©2011 Massachusetts Institute of Technology All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. For information about special quantity discounts, please email [email protected] This book was set in Syntax and Times Roman by Westchester Book Group. Printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Rieffel, Eleanor, 1965– Quantum computing : a gentle introduction / Eleanor Rieffel and Wolfgang Polak. p. cm.—(Scientific and engineering computation) Includes bibliographical references and index. ISBN 978-0-262-01506-6 (hardcover : alk. paper) 1. Quantum computers. 2. Quantum theory. I. Polak, Wolfgang, 1950– II. Title. QA76.889.R54 2011 004.1—dc22 2010022682 10987654321 Contents Preface xi 1 Introduction 1 I QUANTUM BUILDING BLOCKS 7 2 Single-Qubit Quantum Systems 9 2.1 The Quantum Mechanics of Photon Polarization 9 2.1.1 A Simple Experiment 10 2.1.2 A Quantum Explanation 11 2.2 Single Quantum Bits 13 2.3 Single-Qubit Measurement 16 2.4 A Quantum Key Distribution Protocol 18 2.5 The State Space of a Single-Qubit System 21 2.5.1 Relative Phases versus Global Phases 21 2.5.2 Geometric Views of the State Space of a Single Qubit 23 2.5.3 Comments on General Quantum State Spaces
    [Show full text]