Quantum Algorithms in Cybernetics
Petar Nikolov

TL;DR
This paper proposes a quantum computing method for simulating binary Markov processes, utilizing a new quantum logic gate and demonstrating its implementation on IBM's quantum hardware with promising fidelity results.
Contribution
It introduces a novel quantum logic gate for Markov process simulation and explores its implementation on existing noisy quantum hardware.
Findings
Quantum logic gate for Markov processes created and tested.
Best fidelity achieved on IBM's Vigo and Yorktown back-ends.
Hardware topology influences quantum simulation fidelity.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
