Quantum Frequential Computing: a quadratic run time advantage for all algorithms

• URL: http://arxiv.org/abs/2403.02389v1
• Date: Mon, 4 Mar 2024 19:00:02 GMT
• Title: Quantum Frequential Computing: a quadratic run time advantage for all algorithms
• Authors: Mischa P. Woods
• Abstract summary: We introduce a new class of computer called a quantum frequential computer. They harness quantum properties in a different way to conventional quantum computers. They generate a quadratic computational run time advantage for all algorithms as a function of the power consumed.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a new class of computer called a quantum frequential computer. They harness quantum properties in a different way to conventional quantum computers to generate a quadratic computational run time advantage for all algorithms as a function of the power consumed. They come in two variants: type 1 can process classical algorithms only while type 2 can also process quantum ones. In a type-1 quantum frequential computer, only the control is quantum, while in a type 2 the logical space is also quantum. We also prove that a quantum frequential computer only requires a classical data bus to function. This is useful, because it means that only a relatively small part of the overall architecture of the computer needs to be quantum in a type-1 quantum frequential computer in order to achieve a quadratic run time advantage. As with classical and conventional quantum computers, quantum frequential computers also generate heat and require cooling. We also characterise these requirements.

Related papers

• Quantum Computer Does Not Need Coherent Quantum Access for Advantage [0.0]
  A majority of quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner. We develop a quantum gradient descent algorithm for optimization, which is a fundamental technique that enjoys a wide range of applications.
  arXiv  Detail & Related papers  (2025-03-04T11:24:28Z)
• Optimising Iteration Scheduling for Full-State Vector Simulation of Quantum Circuits on FPGAs [1.221089353510972]
  We present a memory access pattern to optimise the number of iterations that need to be scheduled to execute a quantum gate. We show that this approach results in a significant reduction in the time required to simulate a gate for each added control qubit.
  arXiv  Detail & Related papers  (2024-11-27T13:57:29Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• State-Averaged Orbital-Optimized VQE: A quantum algorithm for the democratic description of ground and excited electronic states [0.0]
  The SA-OO-VQE package aims to answer both problems with its hybrid quantum-classical conception based on a typical Variational Quantum Eigensolver approach. The SA-OO-VQE has the ability to treat degenerate (or quasi-degenerate) states on the same footing, thus avoiding known numerical optimization problems around avoided crossings or conical intersections.
  arXiv  Detail & Related papers  (2024-01-22T12:16:37Z)
• Resource-efficient utilization of quantum computers [0.0]
  We suggest a general optimization procedure for hybrid quantum-classical algorithms. We demonstrate this procedure on a specific example of variational quantum algorithm used to find the ground state energy of a hydrogen molecule.
  arXiv  Detail & Related papers  (2023-05-15T18:01:49Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Quantum Computing and the Riemann Hypothesis [0.0]
  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.
  arXiv  Detail & Related papers  (2023-03-07T04:28:54Z)
• 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)
• 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)
• Optimal quantum reservoir computing for the NISQ era [0.0]
  In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates, and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states complexity.
  arXiv  Detail & Related papers  (2022-05-20T12:00:27Z)
• Systematic Literature Review: Quantum Machine Learning and its applications [0.0]
  This manuscript aims to present a Systematic Literature Review of the papers published between 2017 and 2023. This study identified 94 articles that used quantum machine learning techniques and algorithms. An improvement in the quantum hardware is required since the existing quantum computers lack enough quality, speed, and scale to allow quantum computing to achieve its full potential.
  arXiv  Detail & Related papers  (2022-01-11T17:36:34Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• On quantum neural networks [91.3755431537592]
  We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-04-12T18:30:30Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum Computing without Quantum Computers: Database Search and Data Processing Using Classical Wave Superposition [101.18253437732933]
  We present experimental data on magnetic database search using spin wave superposition. We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
  arXiv  Detail & Related papers  (2020-12-15T16:21:53Z)
• Space Complexity of Streaming Algorithms on Universal Quantum Computers [13.941598115553957]
  The space complexity of some data stream problems, such as PartialMOD and Equality, is investigated on universal quantum computers. The quantum algorithms for these problems are believed to outperform their classical counterparts.
  arXiv  Detail & Related papers  (2020-10-31T16:16:35Z)
• Quantum Deformed Neural Networks [83.71196337378022]
  We develop a new quantum neural network layer designed to run efficiently on a quantum computer. It can be simulated on a classical computer when restricted in the way it entangles input states.
  arXiv  Detail & Related papers  (2020-10-21T09:46:12Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Quantum Discriminator for Binary Classification [0.0]
  We propose a novel quantum machine learning model called the Quantum Discriminator. We show that the quantum discriminator can attain 99% accuracy in simulation.
  arXiv  Detail & Related papers  (2020-09-02T19:00:23Z)
• Quadratic Sieve Factorization Quantum Algorithm and its Simulation [16.296638292223843]
  We have designed a quantum variant of the second fastest classical factorization algorithm named "Quadratic Sieve" We have constructed the simulation framework of quantized quadratic sieve algorithm using high-level programming language Mathematica.
  arXiv  Detail & Related papers  (2020-05-24T07:14:19Z)

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.