arXiv subjects

Suhail Ahmad Rather

Publications and source records attributed to Suhail Ahmad Rather.

10 recordsLinked to original sources

arXiv2026

Graph-State Circuit Blocks control Entanglement and Scrambling Velocities

Random circuit models often describe local dynamics using generic two-qubit gates, which have proven successful in capturing entanglement growth and operator spreading in many contexts. This approach naturally leads to the expectation that detailed gate structure plays only a limited role in coarse-grained entanglement and scrambling diagnostics. We show that the internal structure of multipartite circuit primitives can significantly influence these dynamical rates, even within a fixed random-circuit architecture. To investigate this, we study an exactly simulable family of Clifford quantum circuits built from fixed $n$-qubit graph-state preparation unitaries, which we treat as elementary building blocks. Specifically, we consider a one-dimensional chain of $N$ qubits initialized in a product state and evolved by layers in which nonoverlapping length-$n$ blocks are placed at uniformly random positions with sparsity $α$. We find that different choices of graph-state building blocks lead to strongly varying dynamical rates. Graph states that are inequivalent under local Clifford (LC) transformations generate sharply different entanglement velocities $v_E$ and butterfly velocities $v_B$, even though the circuits are drawn from the same ensemble with identical architecture and randomness parameters. We further show that this hierarchy is captured by two complementary block-level characteristics: the distribution of entanglement across internal bipartitions of the graph state, which correlates with $v_E$, and a graph-theoretic connectivity profile across bipartitions, which correlates with $v_B$. Neither descriptor alone fully determines the dynamics; rather, entanglement growth and operator spreading are controlled by distinct structural features of the local circuit blocks. Notably, AME states appear among the fastest scrambling building blocks within the ensembles studied here.

quant-ph↗

arXiv2025

Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States

Absolutely maximally entangled (AME) states of multipartite quantum systems exhibit maximal entanglement across all possible bipartitions. These states lead to teleportation protocols that surpass standard teleportation schemes, determine quantum error correction codes and can be used to test performance of current term quantum processors. Several AME states can be constructed from graph states using minimal quantum resources. However, there exist other constructions that depart from the stabilizer formalism. In this work, we present explicit quantum circuits to generate exemplary non-stabilizer AME states of four subsystems with four, six, and eight levels each and analyze their capabilities to perform quantum information tasks.

quant-ph↗

arXiv2024

Construction of perfect tensors using biunimodular vectors

Dual unitary gates are highly non-local two-qudit unitary gates that have been studied extensively in quantum many-body physics and quantum information in the recent past. A special class of dual unitary gates consists of rank-four perfect tensors that are equivalent to highly entangled multipartite pure states called absolutely maximally entangled (AME) states. In this work, numerical and analytical constructions of dual unitary gates and perfect tensors that are diagonal in a special maximally entangled basis are presented. The main ingredient in our construction is a phase-valued (unimodular) two-dimensional array whose discrete Fourier transform is also unimodular. We obtain perfect tensors for several local Hilbert space dimensions, particularly, in dimension six. A perfect tensor in local dimension six is equivalent to an AME state of four qudits, denoted as AME(4,6). Such a state cannot be constructed from existing constructions of AME states based on error-correcting codes and graph states. An explicit construction of AME(4,6) states is provided in this work using two-qudit controlled and single-qudit gates making it feasible to generate such states experimentally.

quant-ph↗

arXiv2023

Dual unitaries as maximizers of the distance to local product gates

TThe problem of finding the resource free, closest local unitary, to any bipartite unitary gate $U$ is addressed. Previously discussed as a measure of nonlocality, the distance $K_D(U)$ to the nearest product unitary has implications for circuit complexity and related quantities. Dual unitaries, currently of great interest in models of complex quantum many-body systems, are shown to have a preferred role as these are maximally and equally away from the set of local unitaries. This is proved here for the case of qubits and we present strong numerical and analytical evidence that it is true in general. An analytical evaluation of $K_D(U)$ is presented for general two-qubit gates. For arbitrary local dimensions, that $K_D(U)$ is largest for dual unitaries, is substantiated by its analytical evaluations for an important family of dual-unitary and for certain non-dual gates. A closely allied result concerns, for any bipartite unitary, the existence of a pair of maximally entangled states that it connects. We give efficient numerical algorithms to find such states and to find $K_D(U)$ in general.

quant-ph↗

arXiv2023

Absolutely maximally entangled state equivalence and the construction of infinite quantum solutions to the problem of 36 officers of Euler

Ordering and classifying multipartite quantum states by their entanglement content remains an open problem. One class of highly entangled states, useful in quantum information protocols, the absolutely maximally entangled (AME) ones, are specially hard to compare as all their subsystems are maximally random. While, it is well-known that there is no AME state of four qubits, many analytical examples and numerically generated ensembles of four qutrit AME states are known. However, we prove the surprising result that there is truly only {\em one} AME state of four qutrits up to local unitary equivalence. In contrast, for larger local dimensions, the number of local unitary classes of AME states is shown to be infinite. Of special interest is the case of local dimension 6 where it was established recently that a four-party AME state does exist, providing a quantum solution to the classically impossible Euler problem of 36 officers. Based on this, an infinity of quantum solutions are constructed and we prove that these are not equivalent. The methods developed can be usefully generalized to multipartite states of any number of particles.

quant-ph↗

arXiv2022

Construction and local equivalence of dual-unitary operators: from dynamical maps to quantum combinatorial designs

While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are only partially understood. A nonlinear map on the space of unitary operators was proposed in PRL.~125, 070501 (2020) that results in operators being arbitrarily close to dual unitaries. Here we study the map analytically for the two-qubit case describing the basins of attraction, fixed points, and rates of approach to dual unitaries. A subset of dual-unitary operators having maximum entangling power are 2-unitary operators or perfect tensors, and are equivalent to four-party absolutely maximally entangled states. It is known that they only exist if the local dimension is larger than $d=2$. We use the nonlinear map, and introduce stochastic variants of it, to construct explicit examples of new dual and 2-unitary operators. A necessary criterion for their local unitary equivalence to distinguish classes is also introduced and used to display various concrete results and a conjecture in $d=3$. It is known that orthogonal Latin squares provide a ``classical combinatorial design" for constructing permutations that are 2-unitary. We extend the underlying design from classical to genuine quantum ones for general dual-unitary operators and give an example of what might be the smallest sized genuinely quantum design of a 2-unitary in $d=4$.

quant-ph↗

arXiv2022

9 $\times$ 4 = 6 $\times$ 6: Understanding the quantum solution to the Euler's problem of 36 officers

The famous combinatorial problem of Euler concerns an arrangement of $36$ officers from six different regiments in a $6 \times 6$ square array. Each regiment consists of six officers each belonging to one of six ranks. The problem, originating from Saint Petersburg, requires that each row and each column of the array contains only one officer of a given rank and given regiment. Euler observed that such a configuration does not exist. In recent work, we constructed a solution to a quantum version of this problem assuming that the officers correspond to quantum states and can be entangled. In this paper, we explain the solution which is based on a partition of 36 officers into nine groups, each with four elements. The corresponding quantum states are locally equivalent to maximally entangled two-qubit states, hence each officer is entangled with at most three out of his $35$ colleagues. The entire quantum combinatorial design involves $9$ Bell bases in nine complementary $4$-dimensional subspaces.

quant-ph↗

arXiv2021

Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem

The negative solution to the famous problem of $36$ officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution, provided the officers are entangled, and construct orthogonal quantum Latin squares of this size. As a consequence, we find an example of the long-elusive Absolutely Maximally Entangled state AME$(4,6)$ of four subsystems with six levels each, equivalently a $2$-unitary matrix of size $36$, which maximizes the entangling power among all bipartite unitary gates of this dimension, or a perfect tensor with four indices, each running from one to six. This special state deserves the appellation golden AME state as the golden ratio appears prominently in its elements. This result allows us to construct a pure nonadditive quhex quantum error detection code $(\!(3,6,2)\!)_6$, which saturates the Singleton bound and allows one to encode a $6$-level state into a triplet of such states.

quant-ph↗

arXiv2021

From dual-unitary to quantum Bernoulli circuits: Role of the entangling power in constructing a quantum ergodic hierarchy

Deterministic classical dynamical systems have an ergodic hierarchy, from ergodic through mixing, to Bernoulli systems that are "as random as a coin-toss". Dual-unitary circuits have been recently introduced as solvable models of many-body nonintegrable quantum chaotic systems having a hierarchy of ergodic properties. We extend this to include the apex of a putative quantum ergodic hierarchy which is Bernoulli, in the sense that correlations of single and two-particle observables vanish at space-time separated points. We derive a condition based on the entangling power $e_p(U)$ of the basic two-particle unitary building block, $U$, of the circuit, that guarantees mixing, and when maximized, corresponds to Bernoulli circuits. Additionally we show, both analytically and numerically, how local-averaging over random realizations of the single-particle unitaries, $u_i$ and $v_i$ such that the building block is $U^\prime = (u_1 \otimes u_2 ) U (v_1 \otimes v_2 )$ leads to an identification of the average mixing rate as being determined predominantly by the entangling power $e_p(U)$. Finally we provide several, both analytical and numerical, ways to construct dual-unitary operators covering the entire possible range of entangling power. We construct a coupled quantum cat map which is dual-unitary for all local dimensions and a 2-unitary or perfect tensor for odd local dimensions, and can be used to build Bernoulli circuits.

quant-ph↗

arXiv2020

Creating ensembles of dual unitary and maximally entangling quantum evolutions

Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary operators that can create the maximum average entanglement when acting on product states have to satisfy additional constraints. These have been called "2-unitaries" and are examples of perfect tensors that can be used to construct absolutely maximally entangled states of four parties. Hitherto, no systematic method exists, in any local dimension, which result in the formation of such special classes of unitary operators. We outline an iterative protocol, a nonlinear map on the space of unitary operators, that creates ensembles whose members are arbitrarily close to being dual unitaries, while for qutrits and ququads we find that a slightly modified protocol yields a plethora of 2-unitaries. We further characterize the dual unitary operators via their entangling power and the 2-unitaries via the distribution of entanglement created from unentangled states.

quant-ph↗