Recognition: unknown
Quantum Control via Geometry: An explicit example
read the original abstract
We explicitly compute the optimal cost for a class of example problems in geometric quantum control. These problems are defined by a Cartan decomposition of $su(2^n)$ into orthogonal subspaces $\mathfrak{l}$ and $\mathfrak{p}$ such that $[\mathfrak{l},\mathfrak{l}] \subseteq \mathfrak{p}, [\mathfrak{p},\mathfrak{l}] = \mathfrak{p}, [\mathfrak{p},\mathfrak{p}] \subseteq \mathfrak{l}$. Motion in the $\mathfrak{l}$ direction are assumed to have negligible cost, where motion in the $\mathfrak{p}$ direction do not. In the special case of two qubits, our results correspond to the minimal interaction cost of a given unitary.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Generalized Complexity Distances and Non-Invertible Symmetries
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.