ACSS-q: Algorithmic complexity for short strings via quantum accelerated
approach
- URL: http://arxiv.org/abs/2009.08866v1
- Date: Fri, 18 Sep 2020 14:41:41 GMT
- Title: ACSS-q: Algorithmic complexity for short strings via quantum accelerated
approach
- Authors: Aritra Sarkar, Koen Bertels
- Abstract summary: We present a quantum circuit for estimating algorithmic complexity using the coding theorem method.
As a use-case, an application framework for protein-protein interaction based on algorithmic complexity is proposed.
- Score: 1.4873907857806357
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: In this research we present a quantum circuit for estimating algorithmic
complexity using the coding theorem method. This accelerates inferring
algorithmic structure in data for discovering causal generative models. The
computation model is restricted in time and space resources to make it
computable in approximating the target metrics. The quantum circuit design
based on our earlier work that allows executing a superposition of automata is
presented. As a use-case, an application framework for protein-protein
interaction ontology based on algorithmic complexity is proposed. Using
small-scale quantum computers, this has the potential to enhance the results of
classical block decomposition method towards bridging the causal gap in entropy
based methods.
Related papers
- Compressed sensing enhanced by quantum approximate optimization algorithm [0.0]
We present a framework to deal with a range of large scale compressive sensing problems using a quantum subroutine.
Our results explore a promising path of applying quantum computers in the compressive sensing field.
arXiv Detail & Related papers (2024-03-26T05:26:51Z) - Adaptive Circuit Learning of Born Machine: Towards Realization of
Amplitude Embedding and Data Loading [7.88657961743755]
We present a novel algorithm "Adaptive Circuit Learning of Born Machine" (ACLBM)
Our algorithm is tailored to selectively integrate two-qubit entangled gates that best capture the complex entanglement present within the target state.
Empirical results underscore the proficiency of our approach in encoding real-world data through amplitude embedding.
arXiv Detail & Related papers (2023-11-29T16:47:31Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Electronic Structure Calculations using Quantum Computing [0.0]
We present a hybrid Classical-Quantum computational procedure that uses the Variational Quantum Eigensolver (VQE) algorithm.
Our algorithm offers a streamlined process requiring fewer computational resources than classical methods.
Results indicate the potential of the algorithm to expedite the development of new materials and technologies.
arXiv Detail & Related papers (2023-05-13T12:02:05Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - 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) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - 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 single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - A quantum algorithm for gravitational wave matched filtering [0.0]
We propose the application of a quantum algorithm for the detection of unknown signals in noisy data.
In comparison to the classical method, this provides a speed-up proportional to the square-root of the number of templates.
We demonstrate both a proof-of-principle quantum circuit implementation, and a simulation of the algorithm's application to the detection of the first gravitational wave signal GW150914.
arXiv Detail & Related papers (2021-09-03T13:58:58Z) - Deterministic Algorithms for Compiling Quantum Circuits with Recurrent
Patterns [0.0]
Current quantum processors are noisy, have limited coherence and imperfect gate implementations.
We present novel deterministic algorithms for compiling recurrent quantum circuit patterns in time.
Our solution produces unmatched results on RyRz circuits.
arXiv Detail & Related papers (2021-02-17T13:59:12Z)
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.