Related papers: Jordan-Wigner formalism for arbitrary 2-input 2-ou…

We present, in detail and with a modern rigor, the two title proofs. The Weak Jordan Theorem (WJT) states that the complement of any topological circuit in the plane is disconnected.

We shall revisit the conventional treatment of open quantum devices based on the Wigner-Function formalism. Our analysis will show that the artificial spatial separation between device active region and external reservoirs -properly defined…

We give an efficient algorithm to evaluate a certain class of exponential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become $\#\mathsf{P}$-hard to compute when we omit either the…

We study a proof-of-principle example of the recently proposed hybrid quantum-classical simulation of strongly correlated fermion models in the thermodynamic limit. In a "two-site" dynamical mean-field theory (DMFT) approach we reduce the…

We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable…

Jordan, Wigner and von Neumann classified the possible algebras of quantum mechanical observables, and found they fell into 4 "ordinary" families, plus one remarkable outlier: the exceptional Jordan algebra. We point out an intriguing…

We initiate the study of modules of constant Jordan type for quantum complete intersections, and prove a range of basic properties. We then show that for these algebras, constant Jordan type is an invariant of Auslander-Reiten components.…

We demonstrate an implementation scheme for constructing quantum gates using unitary evolutions of the one-dimensional spin-J ferromagnetic XXZ chain. We present numerical results based on simulations of the chain using the time-dependent…

The Bernstein-Vazirani (BV) algorithm is frequently taught as a canonical example of quantum parallelism, yet the standard interference-based explanation often obscures its underlying simplicity. We present a geometric reframing in which…

We present a criterion that serves as the basis for a polynomial-time algorithm to decide whether a finite set of qudit gates exponentiated by some Hamiltonians is universal. Our approach formulates universality in Lie algebraic terms and…

We show that the symmetry operators for the quantum superintegrable system on the 3-sphere with generic 4-parameter potential form a closed quadratic algebra with 6 linearly independent generators that closes at order 6 (as differential…

We introduce a quadratically convergent semismooth Newton method for nonlinear semidefinite programming that eliminates the need for the generalized Jacobian regularity, a common yet stringent requirement in existing approaches. Our…

We propose the effective simulation of light-matter ultrastrong-coupling phenomena with strong-coupling systems. Recent theory and experiments have shown that the quantum Rabi Hamiltonian can be simulated by a Jaynes--Cummings system with…

Holographic algorithms, alternatively known as Pfaffian circuits, have received a great deal of attention for giving polynomial-time algorithms of $\#\mathsf{P}$-hard problems. Much work has been done to determine the extent of what this…

The impetus for this study is the work of Dumas and Rigal on the Jordanian deformation of the ring of coordinate functions on $2\times 2$ matrices. We are also motivated by current interest in birational equivalence of noncommutative rings.…

We construct an explicit set of generators for the finite W-algebras associated to nilpotent matrices in the symplectic or orthogonal Lie algebras whose Jordan blocks are all of the same size. We use these generators to show that such…

In this paper we study generalized J-inner matrix valued functions which appear as resolvent matrices in various indefinite interpolation problems. Reproducing kernel indefinite inner product spaces associated with a generalized J-inner…

Using results of Fayers on the structure of Specht modules, we prove two different formulae for the determinant of matrices which are obtained by amalgamating the entries of two smaller matrices. In particular, this gives formulae for…

We present the Vector Equivalence technique. This technique allows a simple and systematic calculating of Feynman diagrams involving massive fermions at the matrix element level. As its name suggests, the technique allows two Lorentz…

Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner…