Classical analog circuit emulation of quantum Grover search algorithm

• URL: http://arxiv.org/abs/2506.06502v1
• Date: Fri, 06 Jun 2025 19:51:28 GMT
• Title: Classical analog circuit emulation of quantum Grover search algorithm
• Authors: Samuel Feldman, Hassam Ghazali, Andrey Rogachev,
• Abstract summary: We construct a completely analog framework that emulates universal quantum gates and quantum algorithms.<n>In these circuits, input and output lines represent the computational basis states (CBSs) and thus $2n$ lines are required to represent $n$ qubits.<n>The framework can emulate entangled states and is free from decoherence, measurements are classical and do not collapse states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We construct a completely analog framework that emulates universal quantum gates and quantum algorithms. It is based on electronic circuits made of operational amplifiers, resistors and capacitors. In these circuits, input and output lines represent the computational basis states (CBSs) and thus $2^n$ lines are required to represent $n$ qubits. An operation of the circuits is based on classical evolution and interference of complex amplitudes associated with each CBS. The framework can emulate entangled states and is free from decoherence, measurements are classical and do not collapse states. Similar to physical quantum computers, emulated quantum algorithms can be constructed as a sequence of the gates belonging to a universal set (phase shift, Hadamard, controlled-NOT), as a unitary matrix and as combinations of the two. Circuits representing the universal gates have been made and tested. We also have made a matrix-based emulator of a 3-qubit Grover search algorithm. We tested it by searching for one and two particular states with one and two iterations and found that its outputs accurately match predicted values. We anticipate that the emulators can work as sub-components of physical quantum computers. On their own, the emulators can be used for operations that require a few qubits or operations that can be split into independent (and perhaps weakly entangled) blocks of qubits.

Related papers

• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes [0.0]
  We introduce a framework for simulating, on an $(n+1)$-qubit quantum computer, the action of a Gaussian Bosonic (GB) circuit on a state over $2n$ modes. Specifically, we encode the initial bosonic state's expectation values over quadrature operators as an input qubit-state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates.
  arXiv  Detail & Related papers  (2024-07-08T18:04:16Z)
• Multi-strategy Based Quantum Cost Reduction of Quantum Boolean Circuits [0.4999814847776098]
  The construction of quantum computers is based on the synthesis of low-cost quantum circuits. This paper proposes two algorithms to construct a quantum circuit for any Boolean function expressed in a Positive Polarity Reed-Muller $PPRM$ expansion.
  arXiv  Detail & Related papers  (2024-07-05T19:25:46Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• A Complete Equational Theory for Quantum Circuits [58.720142291102135]
  We introduce the first complete equational theory for quantum circuits. Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
  arXiv  Detail & Related papers  (2022-06-21T17:56:31Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• 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)
• Universal quantum computation via quantum controlled classical operations [0.0]
  A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. We show that even a primitive computer capable of implementing only SWAP gates, can be lifted to universal quantum computing.
  arXiv  Detail & Related papers  (2021-04-13T18:00:13Z)
• 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)
• 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)
• Universal topological quantum computation with strongly correlated Majorana edge modes [7.930410828384357]
  Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
  arXiv  Detail & Related papers  (2020-04-07T12:03:14Z)

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.