Analyses of the viability of automating the quantum circuit construction of Grover Oracle for executing wildcard searches on NISQ processors

• URL: http://arxiv.org/abs/2303.08898v1
• Date: Tue, 14 Mar 2023 05:33:09 GMT
• Title: Analyses of the viability of automating the quantum circuit construction of Grover Oracle for executing wildcard searches on NISQ processors
• Abstract summary: This work investigates a technique for encoding search phrases used in wildcard searches. The suggested strategy will be useful for a range of wildcard search issues and could speed up the attainment of quantum advantage.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Using Grover algorithm, this work investigates a technique for encoding search phrases used in wildcard searches. The technique involves creating a phase Oracle that loads data into a quantum circuit together with the search terms that have been encoded. The method entails constructing a phase Oracle programmatically using encoded input information and encoded search terms. By combining Grover diffusion operator with the phase Oracle, Hadamard gates, and zero-initialized three-qubit states, a complete quantum circuit is created. Trapped ion and superconducting qubit quantum computers, which were used in the research, were operated numerous times. In order to confirm that the proposed strategy is a workable one for wildcard search, the outputs from both systems were compared with the expected values. The suggested strategy will be useful for a range of wildcard search issues and could speed up the attainment of quantum advantage.

Related papers

• Exact and Fixed-Point Grover Search with Qudits [0.18049490005680832]
  Grover's algorithm is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two.<n>We present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits.<n>We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms.
  arXiv  Detail & Related papers  (2026-07-27T16:54:09Z)
• A Grover-Based Quantum Algorithm for Solving Perfect Mazes via Fitness-Guided Search [0.0]
  We present a quantum algorithm for solving perfect mazes by casting the pathfinding task as a structured search problem.<n>Building on Grover's amplitude amplification, the algorithm encodes all candidate paths in superposition and evaluates their proximity to the goal.<n>A Grover-compatible oracle marks high-fitness states, and an adaptive cutoff strategy refines the search iteratively.
  arXiv  Detail & Related papers  (2025-07-29T15:51:19Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• 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)
• 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)
• Parametric Synthesis of Quantum Circuits for Training Perceptron Neural Networks [0.0]
  This paper showcases a method of parametric synthesis of quantum circuits for training perceptron neural networks. The circuits were run on a 100-qubit IBM quantum simulator.
  arXiv  Detail & Related papers  (2022-09-20T06:16:17Z)
• 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)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures [1.1091582432763736]
  Grover's algorithm can be used for efficient search in unstructured databases. Quantum oracles that are frequently masked as black boxes play an important role in Grover's algorithm. We present a flexible method for automatically encoding unstructured databases into oracles, which can then be efficiently searched with Grover's algorithm.
  arXiv  Detail & Related papers  (2021-10-14T17:14:04Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Hardware Efficient Quantum Search Algorithm [17.74233101199813]
  We propose a novel hardware efficient quantum search algorithm to overcome this challenge. Our key idea is to replace the global diffusion operation with low-cost local diffusions. The circuit cost reduction leads to a remarkable improvement in the system success rates.
  arXiv  Detail & Related papers  (2021-03-26T01:08:50Z)
• Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
  Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
  arXiv  Detail & Related papers  (2020-12-03T07:12:08Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.