On quantum factoring using noisy intermediate scale quantum computers

• URL: http://arxiv.org/abs/2208.07085v1
• Date: Mon, 15 Aug 2022 09:32:07 GMT
• Title: On quantum factoring using noisy intermediate scale quantum computers
• Authors: Vivian Phan, Arttu P\"onni, Matti Raasakka and Ilkka Tittonen
• Abstract summary: We show better chance of finding the ground state when using VQE rather than QAOA for optimization. In gradient-based optimization we find that the time required for quantum circuit gradient estimation is a significant problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the performance and resource usage of the variational quantum factoring (VQF) algorithm for different instance sizes and optimization algorithms. Our simulations show better chance of finding the ground state when using VQE rather than QAOA for optimization. In gradient-based optimization we find that the time required for quantum circuit gradient estimation is a significant problem if VQF is to become competitive with classical factoring algorithms. Further, we compare entangled and non-entangled circuits in VQE optimization and fail to see significant evidence in favour of including entanglement in the VQE circuit.

Related papers

• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Warm-Starting the VQE with Approximate Complex Amplitude Encoding [0.26217304977339473]
  The Variational Quantum Eigensolver (VQE) is a quantum algorithm to determine the ground state of quantum-mechanical systems. We propose a warm-starting technique, that utilizes an approximation to generate beneficial initial parameter values for the VQE. Such warm-starts open the path to fruitful combinations of classical approximation algorithms and quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-27T10:15:25Z)
• Reinforcement learning-assisted quantum architecture search for variational quantum algorithms [0.0]
  This thesis focuses on identifying functional quantum circuits in noisy quantum hardware. We introduce a tensor-based quantum circuit encoding, restrictions on environment dynamics to explore the search space of possible circuits efficiently. In dealing with various VQAs, our RL-based QAS outperforms existing QAS.
  arXiv  Detail & Related papers  (2024-02-21T12:30:39Z)
• A joint optimization approach of parameterized quantum circuits with a tensor network [0.0]
  Current intermediate-scale quantum (NISQ) devices remain limited in their capabilities. We propose the use of parameterized Networks (TNs) to attempt an improved performance of the Variational Quantum Eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2024-02-19T12:53:52Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Iteration Complexity of Variational Quantum Algorithms [5.203200173190989]
  We argue that noise makes evaluations of the objective function via quantum circuits biased. We derive the missing guarantees and find that the rate of convergence is unaffected.
  arXiv  Detail & Related papers  (2022-09-21T19:18:41Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Classically optimal variational quantum algorithms [0.0]
  Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQA), are suitable for implementation on NISQ computers. In this Letter we expand an implicit step of VQAs: the classical pre-computation subroutine which can non-trivially use classical algorithms to simplify, transform, or specify problem instance-specific variational quantum circuits.
  arXiv  Detail & Related papers  (2021-03-31T13:33:38Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.