Quantum Algorithms in Cybernetics
arXiv:2103.05952
Abstract
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and probability calculations. Implementation of an algorithm based on this method requires the creation of a new quantum logic gate, which creates entangled state between two qubits. This is a two-qubit logic gate and it must perform a predefined rotation over the X-axis for the qubit that acts as a target, where the rotation accurately represents the transient probabilities for a given Markov process. This gate fires only when the control qubit is in state |1>. It is necessary to develop an algorithm, which uses the distribution for the transient probabilities of the process in a simple and intuitive way and then transform those into X-axis offsets. The creation of a quantum controlled n-th root of X gate using only the existing basic quantum logic gates at the available cloud platforms is possible, although the hardware devices are still too noisy, which results in a significant measurement error increase. The IBM's Yorktown 'bow-tie' back-end performs quite better than the 5-qubit T-shaped and the 14-qubit Melbourne quantum processors in terms of quantum fidelity. The simulation of the binary homogeneous Markov process on a real quantum processor gives best results on the Vigo and Yorktown (both 5-qubit) back-ends with Hellinger fidelity of near 0.82. The choice of the right quantum circuit, based on the available hardware (topology, size, timing properties), would be the approach for maximizing the fidelity.
arXiv commentDoctoral Thesis
References in corpus (64)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Quantum algorithm for solving linear systems of equations
- Quantum support vector machine for big data classification
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Quantum principal component analysis
- Quantum Algorithms Revisited
- Quantum state tomography via compressed sensing
- Quantum algorithms: an overview
- Randomized Benchmarking of Quantum Gates
- Quantum Computational Supremacy
- Robust randomized benchmarking of quantum processes
- Validating quantum computers using randomized model circuits
- Quantum computers can search rapidly by using almost any transformation
- Quantum algorithms for supervised and unsupervised machine learning
- Quantum Data Fitting
- Realization of a scalable Shor algorithm
- Shor's quantum factoring algorithm on a photonic chip
- Characterizing Quantum Gates via Randomized Benchmarking
- A Simple Quantum Computer
- Quantum Process Tomography: Resource Analysis of Different Strategies
- Quantum computers can search arbitrarily large databases by a single query
- On the relationship between continuous- and discrete-time quantum walk
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Computing prime factors with a Josephson phase qubit quantum processor
- Decoherence-Free Subspaces and Subsystems
- Quantum Computers, Factoring, and Decoherence
- Prediction by linear regression on a quantum computer
- Symmetrised Characterisation of Noisy Quantum Processes
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- Creating superpositions that correspond to efficiently integrable probability distributions
- Efficient measurement of quantum dynamics via compressive sensing
- Optimal Quantum Clocks
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Tomography and Generative Data Modeling via Quantum Boltzmann Training
- Estimating the spectrum of a density operator
- Microwave-driven coherent operations of a semiconductor quantum dot charge qubit
- Quantum singular value decomposition of non-sparse low-rank matrices
- Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
- Introduction to Quantum Gate Set Tomography
- Introduction to Quantum Algorithms
- An Experimental Study of Shor's Factoring Algorithm on IBM Q
- A quantum algorithm to solve nonlinear differential equations
- Tradeoffs in the Quantum Search Algorithm
- Heralded quantum controlled phase gates with dissipative dynamics in macroscopically-distant resonators
- Entangled Quantum States Generated by Shor's Factoring Algorithm
- Faster Quantum Number Factoring via Circuit Synthesis
- Decoherence, Control, and Symmetry in Quantum Computers
- How fast can a quantum computer search?
- Engineering Functional Quantum Algorithms
- Shor's factorization algorithm with a single control qubit and imperfections
- Appearance and Stability of Anomalously Fluctuating States in Shor's Factoring Algorithm
- Entanglement of Periodic States, the Quantum Fourier Transform and Shor's Factoring Algorithm
- Effects of dynamical phases in Shor's factoring algorithm with operational delays
- Reconsider HHL algorithm and its related quantum machine learning algorithms
- Effects of imperfections for Shor's factorization algorithm
- An entangling-probe attack on Shor's algorithm for factorization
- Realization of Shor's Algorithm at Room Temperature
- Is partial quantum search of a database any easier?