Efficient unstructured search implementation on current ion-trap quantum processors

• URL: http://arxiv.org/abs/2010.03841v1
• Date: Thu, 8 Oct 2020 08:43:14 GMT
• Title: Efficient unstructured search implementation on current ion-trap quantum processors
• Authors: Vladyslav Hlembotskyi, Rafa{\l} Burczy\'nski, Witold Jarnicki, Adam Szady, Jan Tu{\l}owiecki
• Abstract summary: We present experimental results on running unstructured search in spaces defined by 4, 5 and 6 qubits on a quantum processor. Our best circuits obtained respectively 66%, 26% and 6% average probability of measuring the marked element. Viability of the theoretical result by Grover at these qubit counts is, to authors' knowledge demonstrated experimentally for the first time.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: So far, only the results on 3 qubit spaces (both on superconducting and ion-trap realisations of quantum processors) have beaten the classical unstructured search in the expected number of oracle calls using optimal protocols in both settings. We present experimental results on running unstructured search in spaces defined by 4, 5 and 6 qubits on ion-trapped quantum processor. Our best circuits obtained respectively 66\%, 26\% and 6\% average probability of measuring the marked element. In the case of 4 and 5 qubit spaces we obtained fewer expected number of oracle calls required to find a marked element than any classical approach. Viability of the theoretical result by Grover at these qubit counts is, to authors' knowledge demonstrated experimentally for the first time. Also at 6 qubits, a circuit using a single oracle call returned a measured probability of success exceeding any possible classical approach. These results were achieved using a variety of unstructured search algorithms in conjunction with recent developments in reducing the number of entangling gates. The latter are currently considered to be a dominating source of errors in quantum computations. Some of these improvements have been made possible by using mid-circuit measurements. To our knowledge the latter feature is currently available only on the H0 quantum processor we run on.

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)
• 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)
• Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts [1.0507729375838437]
  A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into a set of computations that include smaller-scale quantum (sub)circuits and classical postprocessing steps. We develop an optimal partitioning method based on recent advances in quantum circuit knitting.
  arXiv  Detail & Related papers  (2023-08-18T13:59:55Z)
• State preparation by shallow circuits using feed forward [0.0]
  We make use of this four-step scheme not to carry out fault-tolerant computations, but to enhance short, constant-depth, quantum circuits. We show that LAQCC circuits can create long-ranged interactions, which constant-depth quantum circuits cannot achieve. We create three new state preparation protocols for a uniform superposition over an arbitrary number of states.
  arXiv  Detail & Related papers  (2023-07-27T13:20:21Z)
• Practical Quantum Search by Variational Quantum Eigensolver on Noisy Intermediate-scale Quantum Hardware [0.0]
  We propose a hybrid quantum-classical architecture that replaces quantum iterations with updates from a classical parameterized quantum state. Our approach still maintains usable success probability, while the success probability of Grover search is at the same level as random guessing.
  arXiv  Detail & Related papers  (2023-04-07T17:32:55Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• A Scalable 5,6-Qubit Grover's Quantum Search Algorithm [0.0]
  Grover's quantum search algorithm is one of the well-known applications of quantum computing. In this paper, a scalable Quantum Grover Search algorithm is introduced and implemented using 5-qubit and 6-qubit quantum circuits. The accuracy of the proposed 5-qubit and 6-qubit circuits is benchmarked against the state-of-the-art implementations for 3-qubit and 4-qubit.
  arXiv  Detail & Related papers  (2022-04-30T00:35:54Z)
• 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)
• Benchmarking 16-element quantum search algorithms on superconducting quantum processors [0.0]
  We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We conclude that it is extremely important to design hardware-aware algorithms.
  arXiv  Detail & Related papers  (2020-07-13T17:46:19Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.