Digitized Adiabatic Quantum Factorization
- URL: http://arxiv.org/abs/2105.09480v2
- Date: Sun, 21 Nov 2021 16:00:47 GMT
- Title: Digitized Adiabatic Quantum Factorization
- Authors: Narendra N. Hegade, Koushik Paul, Francisco Albarr\'an-Arriagada, Xi
Chen, Enrique Solano
- Abstract summary: We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm.
We find that this fast factorization algorithm is suitable for available gate-based quantum computers.
- Score: 3.53163169498295
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum integer factorization is a potential quantum computing solution that
may revolutionize cryptography. Nevertheless, a scalable and efficient quantum
algorithm for noisy intermediate-scale quantum computers looks far-fetched. We
propose an alternative factorization method, within the digitized-adiabatic
quantum computing paradigm, by digitizing an adiabatic quantum factorization
algorithm enhanced by shortcuts to adiabaticity techniques. We find that this
fast factorization algorithm is suitable for available gate-based quantum
computers. We test our quantum algorithm in an IBM quantum computer with up to
six qubits, surpassing the performance of the more commonly used factorization
algorithms on the long way towards quantum advantage.
Related papers
- Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
We show that a quantum processor can correctly solve the basic classification task considered.
With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Tensor-Network Simulations of Noisy Quantum Computers [0.0]
We simulate the execution of three quantum algorithms on noisy quantum computers.
We find that they can be executed with high fidelity even at a moderate loss of entanglement.
arXiv Detail & Related papers (2023-04-04T12:42:18Z) - 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) - A quantum Fourier transform (QFT) based note detection algorithm [0.0]
In quantum information processing, the quantum transform (QFT) has a plethora of applications.
We create a quantum music note detection algorithm both on a simulated and a real quantum computer.
arXiv Detail & Related papers (2022-04-25T16:45:56Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - 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) - Resource-efficient encoding algorithm for variational bosonic quantum
simulations [0.0]
In the Noisy Intermediate Scale Quantum (NISQ) era of quantum computing, quantum resources are limited.
We present a resource-efficient quantum algorithm for bosonic ground and excited state computations.
arXiv Detail & Related papers (2021-02-23T19:00:05Z) - 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) - 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)
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.