Unified Information Dynamic Analysis of Quantum Decision-Making and Search Algorithms: Computational Intelligence Measure

• URL: http://arxiv.org/abs/2306.03233v1
• Date: Tue, 30 May 2023 17:04:39 GMT
• Title: Unified Information Dynamic Analysis of Quantum Decision-Making and Search Algorithms: Computational Intelligence Measure
• Authors: Sergey V. Ulyanov, Fabio Ghisi, Ichiro Kurawaki and Viktor S. Ulyanov
• Abstract summary: The evolution of a quantum algorithm (QA) is examined from an information theory viewpoint. The analysis of the classical and quantum information flow in Deutsch-Jozsa, Shor and Grover algorithms is used.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: There are important algorithms built upon a mixture of basic techniques described; for example, the Fast Fourier Transform (FFT) employs both Divide-and-Conquer and Transform-and-Conquer techniques. In this article, the evolution of a quantum algorithm (QA) is examined from an information theory viewpoint. The complex vector entering the quantum algorithmic gate - QAG is considered as an information source both from the classical and the quantum level. The analysis of the classical and quantum information flow in Deutsch-Jozsa, Shor and Grover algorithms is used. It is shown that QAG, based on superposition of states, quantum entanglement and interference, when acting on the input vector, stores information into the system state, minimizing the gap between classical Shannon entropy and quantum von Neumann entropy. Minimizing of the gap between Shannon and von Neumann entropies is considered as a termination criterion of QA computational intelligence measure.

Related papers

• Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
  Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
  arXiv  Detail & Related papers  (2025-06-25T22:25:47Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [48.670876200492415]
  Variational Quantum Algorithms (VQAs) are a promising approach for leveraging powerful Noisy Intermediate-Scale Quantum (NISQ) computers.<n>We propose $rho$DARTS, a differentiable Quantum Architecture Search (QAS) algorithm that models the search process as the evolution of a quantum mixed state.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• An Introduction to Variational Quantum Eigensolver Applied to Chemistry [0.0]
  Variational Quantum Algorithms (VQAs) stand out as a feasible approach to demonstrating advantages over classical methods in the near term.<n>We present the application of quantum mechanics to the study of molecules, provide an introduction to the fundamentals of quantum computing, and explore the integration of these fields by employing the VQE in molecular simulations.
  arXiv  Detail & Related papers  (2025-05-07T19:46:15Z)
• Quantum Machine Learning Algorithms for Anomaly Detection: a Survey [1.747623282473278]
  We summarize the key concepts involved in quantum computing, introducing the formal concept of quantum speed up. The survey provides a structured map of anomaly detection based on quantum machine learning.
  arXiv  Detail & Related papers  (2024-08-20T17:55:25Z)
• Quantum Approximate Optimization: A Computational Intelligence Perspective [1.756184965281354]
  We introduce quantum computing and variational quantum algorithms (VQAs) We explain Farhi et al.'s quantum approximate optimization algorithm (Farhi's QAOA) We discuss connections of QAOA to relevant domains, such as computational learning theory and genetic algorithms.
  arXiv  Detail & Related papers  (2024-07-09T19:40:23Z)
• 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 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)
• 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)
• An introduction to variational quantum algorithms for combinatorial optimization problems [0.0]
  This tutorial provides a mathematical description of the class of Variational Quantum Algorithms. We introduce precisely the key aspects of these hybrid algorithms on the quantum side and the classical side. We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions.
  arXiv  Detail & Related papers  (2022-12-22T14:27:52Z)
• Hybrid Quantum Classical Simulations [0.0]
  We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE) Both are hybrid quantum classical algorithms as they require incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
  arXiv  Detail & Related papers  (2022-10-06T10:49:15Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• 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.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.