22 lines
942 B
Typst
22 lines
942 B
Typst
#import "@preview/classy-tudelft-thesis:0.1.0": *
|
|
#import "@preview/physica:0.9.6": *
|
|
#import "@preview/unify:0.7.1": num, numrange, qty, qtyrange
|
|
#import "@preview/zero:0.5.0"
|
|
|
|
= Theory
|
|
|
|
This section explains the concepts necessary to understand the goal.
|
|
We start by explaining what Quantum Architecture Search is about,
|
|
followed by an explanation of various proxies used in the implemented search, namely Expressivity and Entanglement
|
|
|
|
== Quantum Architecture Search
|
|
|
|
The act of finding the best parametrized quantum circuit to optimize for a specific quantum computer and task.
|
|
In our case I will be talking about "Optimization-Free" QAS as well, which indicates that the parameters of the
|
|
circuits aren't optimized during the search process.
|
|
A consequence of this limitation are task agnostic results like the task agnostic nature of the Hardware Efficient Ansatze as described by Kandala@hea-kandala.
|
|
|
|
== Expressivity
|
|
|
|
== Entanglement
|
|
|