Quantum Computing and the Riemann Hypothesis

• URL: http://arxiv.org/abs/2303.04602v1
• Date: Tue, 7 Mar 2023 04:28:54 GMT
• Title: Quantum Computing and the Riemann Hypothesis
• Authors: Michael McGuigan
• Abstract summary: Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms. We show how to obtain functions as states in supersymmetric quantum mechanics.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer was to the study of the Riemann hypothesis and quantum computers may be applied to this problem as well. In this paper we apply the Quantum Fourier Transform (QFT) to study three functions with non-trivial zeros obeying a version of the Riemann hypothesis. We perform our quantum computations with six qubits, but more qubits can be used if quantum error correction allows the QFT algorithm to scale. We represent these functions as ground state wave functions transformed to momentum space. We show how to obtain these functions as states in supersymmetric quantum mechanics. Finally we discuss the relation of these functions to (p,1) Random two matrix models at large N.

Related papers

• Quantum Cosmology on Quantum Computer [0.0]
  We present the first study of quantum cosmology conducted on physical quantum computers. We employ a newly proposed Hybrid Quantum-Classical (HQC) algorithm rather than the commonly used Variational Quantum Eigensolver (VQE)
  arXiv  Detail & Related papers  (2024-10-29T19:21:25Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Rapidly Achieving Chemical Accuracy with Quantum Computing Enforced Language Model [22.163742052849432]
  QiankunNet-VQE is a transformer based language models enforced with quantum computing to learn and generate quantum states. It has been implemented using up to 12 qubits and attaining an accuracy level competitive with state-of-the-art classical methods.
  arXiv  Detail & Related papers  (2024-05-15T07:50:57Z)
• Quantum Algorithms in a Superposition of Spacetimes [5.475280561991127]
  Quantum computers are expected to revolutionize our ability to process information. We show a first example of a natural computational model based on Quantum Gravity (QG) We show that a quantum computer is able to solve in time two of the fundamental problems in computer science.
  arXiv  Detail & Related papers  (2024-03-05T13:05:07Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Quantum communication complexity of linear regression [0.05076419064097732]
  We show that quantum computers have provable and exponential speedups in terms of communication for some fundamental linear algebra problems. We propose an efficient quantum protocol for quantum singular value transformation.
  arXiv  Detail & Related papers  (2022-10-04T13:27:01Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Quantum Computing Quantum Monte Carlo [8.69884453265578]
  We propose a hybrid quantum-classical algorithm that integrates quantum computing and quantum Monte Carlo. Our work paves the way to solving practical problems with intermediatescale and early-fault tolerant quantum computers.
  arXiv  Detail & Related papers  (2022-06-21T14:26:24Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Quantum Simulation of Quantum Field Theory in the Light-Front Formulation [0.0]
  Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a fundamental level. Uncertainty in the parton distribution function is the dominant source of error in the $W$ mass measurement at the LHC. We show how this can be achieved by using the light-front formulation of quantum field theory.
  arXiv  Detail & Related papers  (2020-02-10T18:43:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.