myacronyms.tex

\begin{acronym}[POVM]%\itemsep.5\baselineskip
%A 
\acro{ACES}{averaged circuit eigenvalue sampling}
\acro{AGF}{average gate fidelity}
\acro{AP}{Arbeitspaket}

%B
\acro{BK}{Bravyi-Kitaev}
\acro{BOG}{binned outcome generation}

%C
\acro{CFG}{context-free grammar}
\acro{CFL}{context-free language}
\acro{CNF}{conjunctive normal form}
\acro{CP}{completely positive}
\acro{CPT}{completely positive and trace preserving}
\acro{cs}{computer science}
\acro{CS}{compressed sensing} 
\acro{ctrl-VQE}{ctrl-VQE}

%D
\acro{DAQC}{digital-analog quantum computing}
\acro{DD}{dynamical decoupling}
\acro{DFA}{deterministic finite automaton}
\acrodefplural{DFA}{deterministic finite automata}
\acro{DFE}{direct fidelity estimation} 
\acro{DFT}{discrete Fourier transform}
\acro{DL}{deep learning}
\acro{DM}{dark matter}

%F
\acro{FFT}{fast Fourier transform}

%G
\acro{GS}{ground-state}
\acro{GST}{gate set tomography}
\acro{GTM}{gate-independent, time-stationary, Markovian}
\acro{GUE}{Gaussian unitary ensemble}

%H
\acro{HOG}{heavy outcome generation}

%I
\acro{irrep}{irreducible representation}

%L
\acro{LBA}{linear bounded automaton}
\acrodefplural{LBA}{linear bounded automata}
\acro{LDPC}{low density partity check}
\acro{LP}{linear program}

%M 
\acro{MAGIC}{magnetic gradient induced coupling}
\acro{MAX-SAT}{maximum satisfiability}
\acro{MBL}{many-body localization}
\acro{MIP}{mixed integer program}
\acro{ML}{machine learning}
\acro{MLE}{maximum likelihood estimation}
\acro{MMP}{matrix mortality problem}
\acro{MPO}{matrix product operator}
\acro{MPS}{matrix product state}
\acro{MS}{M{\o}lmer-S{\o}rensen}
\acro{MSE}{mean squared error}
\acro{MTM}{Multi-tape Turing machine}
\acro{MUBs}{mutually unbiased bases} 
\acro{mw}{micro wave}

%N
\acro{NFA}{non-deterministic finite automaton}
\acrodefplural{NFA}{non-deterministic finite automata}
\acro{NISQ}{noisy and intermediate scale quantum}
\acro{NTM}{non-deterministic Turing machine}
\acro{PTM}{probabilistic Turing machine}

%O
\acro{ONB}{orthonormal basis}
\acroplural{ONB}[ONBs]{orthonormal bases}

%P
\acro{PCP}{Post correspondence problem}
\acro{PDA}{pushdown automaton}
\acro{POVM}{positive operator valued measure}
\acro{PQC}{parametrized quantum circuit}
\acro{PSD}{positive-semidefinite}
\acro{PSR}{parameter shift rule}
\acro{PVM}{projector-valued measure}

%Q
\acro{QAOA}{quantum approximate optimization algorithm}
\acro{QBF}{quantified Boolean formula}
\acro{QC}{quantum computation}
\acro{QEC}{quantum error correction}
\acro{QFT}{quantum Fourier transform}
\acro{QM}{quantum mechanics}
\acro{QML}{quantum machine learning}
\acro{QMT}{measurement tomography}
\acro{QPT}{quantum process tomography}
\acro{QPU}{quantum processing unit}
\acro{QUBO}{quadratic binary optimization}
\acro{QWC}{qubit-wise commutativity}

% R
\acro{RB}{randomized benchmarking}
\acro{RBM}{restricted Boltzmann machine}
\acro{RDM}{reduced density matrix}
\acro{rf}{radio frequency}
\acro{RIC}{restricted isometry constant}
\acro{RIP}{restricted isometry property}
\acro{RMSE}{root mean squared error}
\acro{ROBP}{read once branching program}

% S
\acro{SDP}{semidefinite program}
\acro{SFE}{shadow fidelity estimation}
\acro{SIC}{symmetric, informationally complete}
\acro{SPAM}{state preparation and measurement}
\acro{SPSA}{simultaneous perturbation stochastic approximation}

% T
\acro{TT}{tensor train}
\acro{TM}{Turing machine}
\acro{TV}{total variation}

%V
\acro{VC}{vertex cover problem}
\acro{VQA}{variational quantum algorithm}
\acro{VQE}{variational quantum eigensolver}

%X 
\acro{XEB}{cross-entropy benchmarking}

\end{acronym}