Quantum Logic Gate Synthesis as a Markov Decision Process
- URL: http://arxiv.org/abs/1912.12002v2
- Date: Tue, 5 Jul 2022 21:31:18 GMT
- Title: Quantum Logic Gate Synthesis as a Markov Decision Process
- Authors: M. Sohaib Alam, Noah F. Berthusen, Peter P. Orth
- Abstract summary: We find optimal paths that correspond to the shortest possible sequence of gates to prepare a state or compile a gate.
In the presence of gate noise, we demonstrate how the optimal policy adapts to the effects of noisy gates.
Our work shows that one can meaningfully impose a discrete, deterministic and non-Markovian quantum evolution.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Reinforcement learning has witnessed recent applications to a variety of
tasks in quantum programming. The underlying assumption is that those tasks
could be modeled as Markov Decision Processes (MDPs). Here, we investigate the
feasibility of this assumption by exploring its consequences for two
fundamental tasks in quantum programming: state preparation and gate
compilation. By forming discrete MDPs, focusing exclusively on the single-qubit
case (both with and without noise), we solve for the optimal policy exactly
through policy iteration. We find optimal paths that correspond to the shortest
possible sequence of gates to prepare a state, or compile a gate, up to some
target accuracy. As an example, we find sequences of $H$ and $T$ gates with
length as small as $11$ producing $\sim 99\%$ fidelity for states of the form
$(HT)^{n} |0\rangle$ with values as large as $n=10^{10}$. In the presence of
gate noise, we demonstrate how the optimal policy adapts to the effects of
noisy gates in order to achieve a higher state fidelity. Our work shows that
one can meaningfully impose a discrete, stochastic and Markovian nature to a
continuous, deterministic and non-Markovian quantum evolution, and provides
theoretical insight into why reinforcement learning may be successfully used to
find optimally short gate sequences in quantum programming.
Related papers
- Quantum circuit synthesis via a random combinatorial search [0.0]
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets.
We show that the fraction of perfect-fidelity quantum circuits increases rapidly as soon as the circuit size exceeds the minimum circuit size required for achieving unit fidelity.
arXiv Detail & Related papers (2023-11-29T00:59:29Z) - Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - Probabilistic Interpolation of Quantum Rotation Angles [0.0]
Quantum computing requires a universal set of gate operations; regarding gates as rotations, any rotation angle must be possible.
Here we explore an alternative: Probabilistic Angle Interpolation (PAI)
This effectively implements any desired, continuously parametrised rotation by randomly choosing one of three discretised gate settings and postprocessing individual circuit outputs.
arXiv Detail & Related papers (2023-05-31T14:15:40Z) - Hardware-Conscious Optimization of the Quantum Toffoli Gate [11.897854272643634]
This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level.
We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization.
Our optimized Toffoli gate implementation demonstrates an $18%$ reduction in infidelity compared with the canonical implementation.
arXiv Detail & Related papers (2022-09-06T17:29:22Z) - Quantum Goemans-Williamson Algorithm with the Hadamard Test and
Approximate Amplitude Constraints [62.72309460291971]
We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits.
Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit.
We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
arXiv Detail & Related papers (2022-06-30T03:15:23Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - Coherent randomized benchmarking [68.8204255655161]
We show that superpositions of different random sequences rather than independent samples are used.
We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
arXiv Detail & Related papers (2020-10-26T18:00:34Z) - 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) - Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum
Algorithms [1.9240845160743125]
We demonstrate a continuous two-qubit gate set that can provide a 3x reduction in circuit depth as compared to a standard decomposition.
We benchmark the fidelity of the iSWAP-like and CPHASE gate families as well as 525 other fSim gates spread evenly across the entire fSim parameter space.
arXiv Detail & Related papers (2020-01-23T02:12:45Z)
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.