Related papers: Circuit Complexity From Supersymmetric Quantum Fie…
Superconducting circuits comprising Josephson junctions have spurred significant research activity due to their promise to realize scalable quantum computers. Effective Hamiltonians for these systems have traditionally been derived assuming…
With recent improvements in coherence times, superconducting transmon qubits have become a promising platform for quantum computing. They can be flexibly engineered over a wide range of parameters, but also require us to identify an…
Inspired by the structural unification of unitary groups (quantum field theory) with orthogonal groups (relativity) proposed recently through a non-division algebra, we construct a hypercomplex field theory with an internal symmetry that…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the…
The system of two $Q$-deformed oscillators coupled so that the total Hamiltonian has the su$_Q$(2) symmetry is proved to be equivalent, to lowest order approximation, to a system of two identical Morse oscillators coupled by the…
We derive a geometric representation of couplings between spin degrees of freedom and gauge fields within the worldline approach to quantum field theory. We combine the string-inspired methods of the worldline formalism with elements of the…
We review the recent progress in studying the quantum structure of $6D$, ${\cal N}=(1,0)$ and ${\cal N}=(1,1)$ supersymmetric gauge theories formulated through unconstrained harmonic superfields. The harmonic superfield approach allows one…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
A new class of cost functionals for optimal control of quantum systems which produces controls which are sparse in frequency and smooth in time is proposed. This is achieved by penalizing a suitable time-frequency representation of the…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…
We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present day noisy quantum computing platforms. This method can be run post qubit routing or post-compilation,…
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the…
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely…
We describe the loop corrections to supercharges in supersymmetric quantum field theories using the holomorphic twist formalism. We begin by reviewing the relation between supercharge corrections and the "twice-generalized" Konishi anomaly,…
Investigation of strongly interacting, nonlinear quantum field theories (QFT-s) remains one of the outstanding challenges of modern physics. Here, we describe analog quantum simulators for nonlinear QFT-s using mesoscopic superconducting…
We derive the fermion loop formulation of N=4 supersymmetric SU(N) Yang-Mills quantum mechanics on the lattice. The loop formulation naturally separates the contributions to the partition function into its bosonic and fermionic parts with…
The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A…
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we…
The qualitatively new concept of dynamic complexity in quantum mechanics is based on a new paradigm appearing within a nonperturbational analysis of the Schroedinger equation for a generic Hamiltonian system. The unreduced analysis…