Simon's algorithm in the NISQ cloud

• URL: http://arxiv.org/abs/2406.11771v1
• Date: Mon, 17 Jun 2024 17:31:44 GMT
• Title: Simon's algorithm in the NISQ cloud
• Authors: Reece Robertson, Emery Doucet, Ernest Spicer, Sebastian Deffner,
• Abstract summary: Simon's algorithm was one of the first problems to demonstrate a genuine quantum advantage. We use Simon's algorithm to benchmark the error rates of devices currently available in the "quantum cloud"
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simon's algorithm was one of the first problems to demonstrate a genuine quantum advantage. The algorithm, however, assumes access to noise-free qubits. In our work we use Simon's algorithm to benchmark the error rates of devices currently available in the "quantum cloud." As a main result we obtain an objective comparison between the different physical platforms made available by IBM and IonQ. Our study highlights the importance of understanding the device architectures and chip topologies when transpiling quantum algorithms onto hardware. For instance, we demonstrate that two-qubit operations on spatially separated qubits on superconducting chips should be avoided.

Related papers

• Simon algorithm in measurement-based quantum computing [0.0]
  Simon's subgroup hidden algorithm was the first quantum algorithm to prove the superiority of quantum computing over classical computing. We present a reformulation of the Simon algorithm into the language of measurement-based quantum computing. We show that the $n$-qubit version of the Simon algorithm can be formulated in MBQC as cluster state graph with $2n$ nodes and $n2$ edges.
  arXiv  Detail & Related papers  (2024-05-28T13:02:54Z)
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering [38.02852247910155]
  A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns. We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor. We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T14:02:45Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Exact distributed quantum algorithm for generalized Simon's problem [8.061563029894927]
  Simon's problem is one of the most important problems demonstrating the power of quantum algorithms. We introduce a corresponding distributed quantum algorithm for Simon's problem. We refine the algorithm to ensure exactness due to the application of quantum amplitude amplification technique.
  arXiv  Detail & Related papers  (2023-07-26T17:25:39Z)
• Solving Graph Problems Using Gaussian Boson Sampling [22.516585968074146]
  We use a noisy intermediate-scale quantum computer to solve graph problems. We experimentally observe the presence of GBS enhancement with large photon-click number and an enhancement under certain noise. Our work is a step toward testing real-world problems using the existing intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-02-02T08:25:47Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Distributed quantum algorithm for Simon's problem [2.26741603346646]
  We study the Simon's problem in distributed scenarios and design a distributed quantum algorithm to solve the problem. The novel computing architecture of distributed quantum computing is expected to reduce the noise and depth of quantum circuits.
  arXiv  Detail & Related papers  (2022-04-25T01:22:22Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Optimization and Noise Analysis of the Quantum Algorithm for Solving One-Dimensional Poisson Equation [17.65730040410185]
  We propose an efficient quantum algorithm for solving one-dimensional Poisson equation. We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
  arXiv  Detail & Related papers  (2021-08-27T09:44:41Z)
• Supervised Learning Using a Dressed Quantum Network with "Super Compressed Encoding": Algorithm and Quantum-Hardware-Based Implementation [7.599675376503671]
  Implementation of variational Quantum Machine Learning (QML) algorithms on Noisy Intermediate-Scale Quantum (NISQ) devices has issues related to the high number of qubits needed and the noise associated with multi-qubit gates. We propose a variational QML algorithm using a dressed quantum network to address these issues. Unlike in most other existing QML algorithms, our quantum circuit consists only of single-qubit gates, making it robust against noise.
  arXiv  Detail & Related papers  (2020-07-20T16:29:32Z)

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.