noa/thesis
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

update planning

Browse source
This commit is contained in:
Noa Aarts 2026-02-06 14:44:41 +01:00
parent 130a64755f
commit 7d09aa88ab
Signed by: noa
GPG key ID: 1850932741EFF672
4 changed files with 98 additions and 23 deletions
Download patch file Download diff file Expand all files Collapse all files

16
report/sections/2theory.typ
View file

@ -3,4 +3,20 @@
#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