Related papers: Towards Equivalence Checking of Classical Circuits Using Quantum Computing

Towards Equivalence Checking of Classical Circuits Using Quantum Computing

URL: http://arxiv.org/abs/2408.14539v1
Date: Mon, 26 Aug 2024 18:00:03 GMT
Title: Towards Equivalence Checking of Classical Circuits Using Quantum Computing
Authors: Nils Quetschlich, Tobias Forster, Adrian Osterwind, Domenik Helms, Robert Wille,
Abstract summary: We propose a working concept of a quantum computing methodology for equivalence checking. We show that, although this might be an obvious choice, there are several pitfalls to avoid in order to get meaningful results.
Score: 2.6235431676697263
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Quantum computers and quantum algorithms have made great strides in the last few years and promise improvements over classical computing for specific tasks. Although the current hardware is not yet ready to make real impacts at the time of writing, this will change over the coming years. To be ready for this, it is important to share knowledge of quantum computing in application domains where it is not yet represented. One such application is the verification of classical circuits, specifically, equivalence checking. Although this problem has been investigated over decades in an effort to overcome the verification gap, how it can potentially be solved using quantum computing has hardly been investigated yet. In this work, we address this question by considering a presumably straightforward approach: Using Grover's algorithm. However, we also show that, although this might be an obvious choice, there are several pitfalls to avoid in order to get meaningful results. This leads to the proposal of a working concept of a quantum computing methodology for equivalent checking providing the foundation for corresponding solutions in the (near) future.

Related papers

Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing [0.0]
Quantum computers have long been more of a toy for researchers than a tool for solving complex problems.<n>Recent advances in the field make exploiting the advantages of fault-tolerant quantum computers feasible in the next 5 to 10 years.<n>It is now time to begin imagining how such devices could be used in practice for game development and deployment.
arXiv Detail & Related papers (2025-08-13T10:22:20Z)
Quantum Computer Does Not Need Coherent Quantum Access for Advantage [0.0]
A majority of quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner. We develop a quantum gradient descent algorithm for optimization, which is a fundamental technique that enjoys a wide range of applications.
arXiv Detail & Related papers (2025-03-04T11:24:28Z)
Benefits of non-adiabatic quantum control in quantum computation through spin qubit systems [0.0]
controllable quantum systems can be reliable building blocks for Quantum computation. In the future, we hope to see a full fledged operationally stable quantum computer.
arXiv Detail & Related papers (2024-03-17T17:48:51Z)
Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z)
Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z)
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems [1.1470070927586016]
We discuss the field of quantum optimization where we solve optimisation problems using quantum computers. We demonstrate this through a proper use case and discuss the current quality of quantum computers. We conclude with discussion on some recent quantum optimization breakthroughs and the current status and future directions.
arXiv Detail & Related papers (2022-12-21T12:56:37Z)
Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation [5.381727213688375]
We are still a long way from reaching the maturity of a full-fledged quantum computer. An outstanding challenge is to come up with an application that can reliably carry out a nontrivial task. Several near-term quantum computing techniques have been proposed to characterize and mitigate errors.
arXiv Detail & Related papers (2022-11-16T07:53:15Z)
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)
Retrodictive Quantum Computing [0.6445605125467572]
We show how to exploit retrodictive quantum computing at scale. We solve instances of the quantum Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's algorithms.
arXiv Detail & Related papers (2022-05-12T20:12:41Z)
A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z)
Using Shor's algorithm on near term Quantum computers: a reduced version [0.0]
We introduce a reduced version of Shor's algorithm that proposes a step forward in increasing the range of numbers that can be factorized on noisy Quantum devices. In particular, we have found noteworthy results in most cases, often being able to factor the given number with only one of the proposed algorithm.
arXiv Detail & Related papers (2021-12-23T15:36:59Z)
Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z)
On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z)
Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z)
An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.