Kluwer Academic Publishers eBooks

Information Analysis of Quantum Gates for Simulation of Quantum Algorithms on Classical Computers

Sergey Victorovich Ulyanov, Sergey A. Panfilov, I. Kurawaki, Alexander Vasilyevich Yazenin

Published Feb 24, 2006• 7 citations

Abstract

Quantum algorithm dynamics of quantum computation states are analyzed from classical and quantum information theory standpoint. The information measure of intelligence for a quantum algorithm states with respect to a subset of qubits is defined. The intelligence of a state is maximal if the gap between the Shannon and the Von Neumann entropy for the chosen result qubits is minimal. We prove the Quantum Fourier Transform creates maximally intelligent states with respect to the first n qubits for Shor’s problem, since it annihilates the gap between classical and quantum entropy for the first n qubits of every output state. Dynamic and information analysis of Shor’s algorithm are described. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI: 10.1007/0-306-47114-0_32

Related papers

The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics

Fabio Ghisi, Sergey Victorovich Ulyanov

Shor algorithm dynamics of quantum computation states are analysed from the classical and the quantum information theory points of view. The Shannon entropy is interpreted as the degree of information accessibility through measurement, while the von Neumann entropy is employed to measure the quantum information of entanglement. The intelligence of a state with respect to a subset of qubits is defined. The intelligence of a state is maximal if the gap between the Shannon and the von Neumann entropy for the chosen result qubits is minimal. We prove that the quantum Fourier transform creates maximally intelligent states with respect to the first n qubits for Shor's problem, since it annihilates the gap between the classical and quantum entropies for the first n qubits of every output state.

Journal of Modern OpticsOct 1, 20006 citations

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

Sergey Victorovich Ulyanov, Fabio Ghisi, I. Kurawaki +1 more

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.

arXiv:2306.03233May 30, 20230 citations

Entropy and Algorithmic Complexity in Quantum Information Theory: a Quantum Brudno's Theorem

Fabio Benatti, Tyll Krueger, Markus P. Müller +2 more

In classical information theory, entropy rate and algorithmic complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum algorithmic complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them as outputs.

Jun 10, 20051 citation

Additivity/Multiplicativity Communication Channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooksFeb 24, 20060 citations

Computational Complexity Analysis of Quantum Algorithms using Information Theory

Jincheng Zhang

This paper explores the application of information theory to analyze the computational complexity of quantum algorithms. Traditional approaches to complexity analysis often rely on circuit models and gate complexity, which can be insufficient for fully characterizing the resource requirements of quantum computation. We propose utilizing information-theoretic concepts, specifically quantum entropy and mutual information, to provide a more nuanced understanding of how quantum circuits process information. This approach allows us to quantify the information-theoretic limits of quantum algorithms, providing insights into the number of qubits and gates necessary for efficient execution. We examine several key aspects, including the role of entanglement, the impact of measurement, and the relationship between quantum entropy and algorithmic complexity. The goal is to establish a framework for assessing quantum algorithms based on their fundamental information-processing capabilities, moving beyond purely circuit-based evaluations. This work contributes to a deeper theoretical understanding of quantum computation and its potential limitations.

Sep 2, 20260 citations

Quantum Information Entropy: Dynamic Computation and Optimization

Jincheng Zhang

Quantum information entropy, a fundamental measure of uncertainty, is a cornerstone of quantum mechanics and a critical factor in the design of quantum algorithms and systems. This paper investigates the application of dynamic computation techniques, leveraging quantum information entropy, to optimize quantum system performance and efficiency. We propose a novel algorithm that dynamically calculates and optimizes quantum systems based on the inherent properties of this entropy, aiming to maximize information utilization and improve overall system functionality. The core mechanism centers around a quantum-state evolution algorithm that adapts to the system's state, dynamically adjusting parameters to achieve optimal performance. This work introduces a new approach to quantum system optimization, demonstrating potential improvements in key metrics including fidelity and reduced error rates.

Sep 5, 20260 citations