Beyond Ansätze: Learning Quantum Circuits as Unitary Operators

03/01/2022
by   Bálint Máté, et al.
0

This paper explores the advantages of optimizing quantum circuits on N wires as operators in the unitary group U(2^N). We run gradient-based optimization in the Lie algebra 𝔲(2^N) and use the exponential map to parametrize unitary matrices. We argue that U(2^N) is not only more general than the search space induced by an ansatz, but in ways easier to work with on classical computers. The resulting approach is quick, ansatz-free and provides an upper bound on performance over all ansätze on N wires.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/01/2021

An upper bound on the Universality of the Quantum Approximate Optimization Algorithm

Using lie algebra, this brief text provides an upper bound on the univer...
research
07/17/2016

Learning Unitary Operators with Help From u(n)

A major challenge in the training of recurrent neural networks is the so...
research
10/02/2022

Quark: A Gradient-Free Quantum Learning Framework for Classification Tasks

As more practical and scalable quantum computers emerge, much attention ...
research
09/07/2021

Optimizing Quantum Variational Circuits with Deep Reinforcement Learning

Quantum Machine Learning (QML) is considered to be one of the most promi...
research
02/21/2022

Classical versus Quantum: comparing Tensor Network-based Quantum Circuits on LHC data

Tensor Networks (TN) are approximations of high-dimensional tensors desi...
research
06/16/2020

Circuits: An abstract viewpoint

Our primary purpose is to isolate the abstract, mathematical properties ...
research
02/08/2021

Learning with Density Matrices and Random Features

A density matrix describes the statistical state of a quantum system. It...

Please sign up or login with your details

Forgot password? Click here to reset