Canonical Construction of Quantum Oracles

• URL: http://arxiv.org/abs/2006.10656v1
• Date: Thu, 18 Jun 2020 16:28:55 GMT
• Title: Canonical Construction of Quantum Oracles
• Authors: Austin Gilliam, Marco Pistoia, and Constantin Gonciulea
• Abstract summary: A common, but inefficient automation approach is to use oracles with classical evaluation of all the states at circuit design time. We present a novel, canonical way to produce a quantum oracle from an algebraic expression, that maps a set of selected states to the same value, coupled with a simple oracle that matches that particular value. In addition, this paper presents experimental results obtained on real quantum hardware, the new Honeywell computer based on trapped-ion technology with quantum volume 64.
• Score: 4.220030262107688
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Selecting a set of basis states is a common task in quantum computing, in order to increase and/or evaluate their probabilities. This is similar to designing WHERE clauses in classical database queries. Even though one can find heuristic methods to achieve this, it is desirable to automate the process. A common, but inefficient automation approach is to use oracles with classical evaluation of all the states at circuit design time. In this paper, we present a novel, canonical way to produce a quantum oracle from an algebraic expression (in particular, an Ising model), that maps a set of selected states to the same value, coupled with a simple oracle that matches that particular value. We also introduce a general form of the Grover iterate that standardizes this type of oracle. We then apply this new methodology to particular cases of Ising Hamiltonians that model the zero-sum subset problem and the computation of Fibonacci numbers. In addition, this paper presents experimental results obtained on real quantum hardware, the new Honeywell computer based on trapped-ion technology with quantum volume 64.

Related papers

• Unified Architecture for a Quantum Lookup Table [1.0923877073891446]
  Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms. We present a general parameterized architecture for quantum circuits implementing a lookup table. Our architecture assumes only local 2D connectivity, yet recovers results that previously required all-to-all connectivity.
  arXiv  Detail & Related papers  (2024-06-26T02:54:02Z)
• SQL2Circuits: Estimating Metrics for SQL Queries with a Quantum Natural Language Processing Method [1.5540058359482858]
  This work employs a quantum natural language processing (QNLP)-inspired approach for constructing a quantum machine learning model. The model consists of an encoding mechanism and a training phase, including classical and quantum subroutines. We conclude that our model reaches an accuracy equivalent to that of the QNLP model in the binary classification tasks.
  arXiv  Detail & Related papers  (2023-06-14T14:23:19Z)
• Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification [0.4374837991804085]
  Grover's algorithm is a well-known contribution to quantum computing. We present a classical algorithm that builds a phase-marking oracle for Amplitude Amplification.
  arXiv  Detail & Related papers  (2023-03-13T13:52:19Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• 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)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Oracle separations of hybrid quantum-classical circuits [68.96380145211093]
  Two models of quantum computation: CQ_d and QC_d. CQ_d captures the scenario of a d-depth quantum computer many times; QC_d is more analogous to measurement-based quantum computation. We show that, despite the similarities between CQ_d and QC_d, the two models are intrinsically, i.e. CQ_d $nsubseteq$ QC_d and QC_d $nsubseteq$ CQ_d relative to an oracle.
  arXiv  Detail & Related papers  (2022-01-06T03:10:53Z)
• Quantum circuit design for universal distribution using a superposition of classical automata [2.4192504570921622]
  This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative models. A classical exhaustive enumeration of all possible programs on the automata is shown for a couple of example cases. This is the first time, a superposition of classical automata is implemented on the circuit model of quantum computation.
  arXiv  Detail & Related papers  (2020-06-01T14:47:28Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.