Combinatorial foundations for solvable chaotic local Euclidean quantum circuits in two dimensions

• URL: http://arxiv.org/abs/2512.03029v1
• Date: Tue, 02 Dec 2025 18:54:23 GMT
• Title: Combinatorial foundations for solvable chaotic local Euclidean quantum circuits in two dimensions
• Authors: Fredy Yip,
• Abstract summary: We show that any bounded extension of $mathbbZ2$ is geodesically directable.<n>This provides a setting in which one could devise exactly-solvable chaotic local quantum circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same vertex set, and the graph distance $d_L(u, v)$ is uniformly bounded for edges $uv\in G$. Given vertices $u, v$ in $G$ and an integer $k$, the geodesic slice $S(u, v, k)$ denotes the subset of vertices $w$ lying on a geodesic in $G$ between $u$ and $v$ with $d_G(u, w) = k$. We say that $G$ has bounded geodesic slices if $|S(u, v, k)|$ is uniformly bounded over all $u, v, k$. We call a graph $L$ geodesically directable if it has a bounded extension $G$ with bounded geodesic slices. Contrary to previous expectations, we prove that $\mathbb{Z}^2$ is geodesically directable. Physically, this provides a setting in which one could devise exactly-solvable chaotic local quantum circuits with non-trivial correlation patterns on 2D Euclidean lattices. In fact, we show that any bounded extension of $\mathbb{Z}^2$ is geodesically directable. This further implies that all two-dimensional regular tilings are geodesically directable.

Related papers

• Almost all graphs are vertex-minor universal [0.0]
  We prove that the uniformly random graph $Gsim mathrmvm(k)$ is $(sqrt n)$-vertex-minor universal with high probability.<n>This has direct implications for quantum communications networks.
  arXiv  Detail & Related papers  (2026-02-06T20:59:33Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• A Variant of the Bravyi-Terhal Bound for Arbitrary Boundary Conditions [10.560637835517094]
  We consider a quotient $mathbbZD/Lambda$ of $mathbbZD$ of cardinality $n$ on a $D$-dimensional lattice quotient.<n>We prove that if all stabilizer generators act on qubits whose indices lie within a ball of radius $rho$, the minimum distance $d$ of the code satisfies $d leq msqrtgamma_D(sqrtD + 4rho)nfracD-1D$ whenever $n1/D
  arXiv  Detail & Related papers  (2025-02-07T15:18:40Z)
• A note on quantum lower bounds for local search via congestion and expansion [4.68073705539907]
  We show that the quantum query complexity of local search on $G$ is $Omegabigl( fracnfrac34sqrtg bigr)$.<n>In contrast to the classical setting, a gap remains in the quantum case between our lower bound and the best-known upper bound of $Obigl( nfrac13 bigr)$ for such graphs.
  arXiv  Detail & Related papers  (2024-12-17T21:42:42Z)
• Geodesics for mixed quantum states via their geometric mean operator [0.0]
  We examine the geodesic between two mixed states of arbitrary dimension by means of their mean operator. We show how it can be used to construct the intermediate mixed quantum states $rho(s)$ along the base space geodesic parameterized by affine. We give examples for the geodesic between the maximally mixed state and a pure state in arbitrary dimensions, as well as for the geodesic between Werner states $rho(p) = (1-p) I/N + p,|Psiranglelangle Psi|$ with $|Psir
  arXiv  Detail & Related papers  (2024-04-05T14:36:11Z)
• Detection of Dense Subhypergraphs by Low-Degree Polynomials [72.4451045270967]
  Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem. We consider detecting the presence of a planted $Gr(ngamma, n-alpha)$ subhypergraph in a $Gr(n, n-beta) hypergraph. Our results are already new in the graph case $r=2$, as we consider the subtle log-density regime where hardness based on average-case reductions is not known.
  arXiv  Detail & Related papers  (2023-04-17T10:38:08Z)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Improved Reconstruction of Random Geometric Graphs [3.930410971186142]
  We consider the classic model of random geometric graphs where $n$ points are scattered uniformly in a square of area $n$. We use a hybrid of graph distances and short-range estimates based on the number of common neighbors to estimate Euclidean distances. Our method estimates Euclidean distances using a hybrid of graph distances and short-range estimates based on the number of common neighbors.
  arXiv  Detail & Related papers  (2021-07-29T20:37:28Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Linear Bandits on Uniformly Convex Sets [88.3673525964507]
  Linear bandit algorithms yield $tildemathcalO(nsqrtT)$ pseudo-regret bounds on compact convex action sets. Two types of structural assumptions lead to better pseudo-regret bounds.
  arXiv  Detail & Related papers  (2021-03-10T07:33:03Z)
• Phase Squeezing of Quantum Hypergraph States [0.0]
  A quantum hypergraph state is defined by $|Grangle = frac1sqrt2dsum_n = 02d - 1 (-1)f(n) |n rangle$. We establish that these states are squeezed in the phase quadrature only and satisfy the Agarwal-Tara criterion for non-classicality.
  arXiv  Detail & Related papers  (2020-08-31T18:31:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.