refs

codes/quantum/categories/string_net/string_net.yml

@@ -35,6 +35,7 @@ features:
   encoders:
     - 'For an \(L\times L\) lattice, deterministic state preparation can be done with a geometrically local unitary \(O(L)\)-depth circuit \cite{arxiv:2110.02020} or an \(O(\log{L})\)-depth unitary circuit with non-local two-qubit gates \cite{arxiv:0712.0348,arxiv:0806.4583}.'
     - 'Scalable dynamic string-net preparation (DSNP) \cite{arxiv:2406.12820}.'
+    - 'String nets with solvable anyons and gappable boundaries \cite[Def. 1.2]{arxiv:0809.3031} can be prepared via an adaptive finite-depth local unitary circuit \cite{arxiv:2411.04985}.'
   general_gates:
     - 'Gates can be implemented through topological operations corresponding to elements of the mapping class group, which is generated by Dehn-twists along non-contractible cycles for triangulations of toroidal \cite{arxiv:1806.02358,arxiv:1806.06078} and hyperbolic \cite{arxiv:1901.11029} manifolds.
     Whether or not a gate set is universal depends on the choice of input category; in some cases such as the Ising category, gates can be complemented by topological charge measurements to obtain a universal gate set.'

codes/quantum/properties/asymmetric_qecc.yml

@@ -97,6 +97,8 @@ relations:
       detail: 'QPC parameters against bit- and phase-noise can be tuned.'
     - code_id: eastab
       detail: 'Entanglement can help decode asymmetric quantum codes \cite{arxiv:1104.5004}.'
+    - code_id: floquet
+      detail: 'Floquet codes can be adapted for asymmetric noise \cite{arxiv:2411.04974}.'
 
 
 

codes/quantum/qubits/qubits_into_qubits.yml

@@ -114,6 +114,7 @@ features:
     Universal quantum computing can be achieved using Clifford gates and a single type of non-Clifford gate, such as the \(T\) gate \cite{arxiv:quant-ph/9503016}.
     More generally, the \textit{Solovay-Kitaev} theorem \cite{doi:10.1070/rm1997v052n06abeh002155,doi:10.1090/gsm/047} states that any subset of gates the generates a dense subgroup of the full \(n\)-qubit gate group can be used to construct any gate to arbitrary accuracy (see \cite{arxiv:quant-ph/0505030}\cite[Appx. 3]{doi:10.1017/cbo9780511976667.019}). The task of approximating a desired gate by Clifford gates and a fixed set of non-Clifford gates is called \textit{gate compilation} or \textit{circuit synthesis}.'
     - 'Non-Clifford gates are typically more difficult to implement than Clifford gates and so are treated as a resource. Optimizing T-gate count in circuit synthesis is \(NP\)-hard \cite{arxiv:2310.05958} and can be done using various procedures \cite{arxiv:1303.2042,arxiv:1308.4134,arxiv:1601.07363,arxiv:1710.07345,arxiv:1712.01557,arxiv:2110.10292}, e.g., \textit{ZX calculus} (a.k.a. Penrose spin calculus) \cite{arxiv:1903.10477,arxiv:1911.09039,arxiv:2004.05164,arxiv:2109.01076} or reinforcement learning \cite{arxiv:2402.14396}.
+    There is an optimal asymptotic scaling of the number of T gates needed to prepare an arbitrary state \cite{arxiv:1812.00954,arxiv:2411.04790}.
     Decompositions in terms of Toffoli and Hadamard gates \cite{arxiv:quant-ph/0205115} as well as cosine-sine gates also exist \cite{arxiv:quant-ph/0404089}. Gate errors in circuit synthesis can sometimes add up destructively \cite{arxiv:1612.01011}.'
     - '\begin{defterm}{Clifford hierarchy}
       \label{topic:clifford-hierarchy}

codes/quantum/qudits_galois/stabilizer/qldpc/balanced_product/lp/matrix/abelian_lifted_product.yml

@@ -25,7 +25,7 @@ features:
 
   decoders:
     - 'Ensemble BP decoder for codes without short cycles of length 4 \cite{arxiv:2401.06874}.'
-
+    - 'Efficient decoder correcting \hyperref[topic:asymptotics]{order} \(\Theta(n/\log n)\) errors \cite{arxiv:2411.04464}.'
 
 relations:
   parents: