Quantum Algorithms in Cybernetics
- URL: http://arxiv.org/abs/2103.05952v2
- Date: Thu, 11 Mar 2021 09:15:23 GMT
- Title: Quantum Algorithms in Cybernetics
- Authors: Petar Nikolov
- Abstract summary: A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed.
It allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and probability calculations.
The choice of the right quantum circuit, based on the available hardware, would be the approach for maximizing the fidelity.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- 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.
Related papers
- Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation [0.0]
We introduce novel non-probabilistic algorithms for simulating Markovian open quantum systems using randomisation.
Our methods maintain the physicality of the system's evolution but also enhance the scalability and precision of quantum simulations.
This work is the first to apply randomisation techniques to the simulation of open quantum systems, highlighting their potential to enable faster and more accurate simulations.
arXiv Detail & Related papers (2024-08-21T15:06:29Z) - Benchmarking the algorithmic performance of near-term neutral atom
processors [0.0]
We present a characterization of the algorithmic performance of Rydberg atom quantum computers through device simulation.
We consider three different quantum algorithm related tests, exploiting the ability to dynamically update qubit connectivity and multi-qubit gates.
Our results indicate Rydberg atom processors are a highly competitive near-term platform which, bolstered by the potential for further scalability, can pave the way toward useful quantum computation.
arXiv Detail & Related papers (2024-02-03T11:55:02Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit.
The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$.
We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
arXiv Detail & Related papers (2021-12-29T12:33:41Z) - A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner.
We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
arXiv Detail & Related papers (2021-12-07T19:00:00Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Fast-Forwarding with NISQ Processors without Feedback Loop [0.0]
We present the Classical Quantum Fast Forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation.
CQFF removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries.
Our work provides a $104$ improvement over the previous record.
arXiv Detail & Related papers (2021-04-05T14:29:33Z) - Special-Purpose Quantum Processor Design [2.275405513780208]
Full connectivity of qubits is necessary for most quantum algorithms.
inserting swap gate to enable the two-qubit gates between uncoupled qubits significantly decreases the computation result fidelity.
We propose a Special-Purpose Quantum Processor Design method that can design suitable structures for different quantum algorithms.
arXiv Detail & Related papers (2021-02-01T23:26:15Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
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.