相关论文: Unitarization of Pseudo-Unitary Quantum Circuits i…
There is a unique finite group that lies inside the 2-dimensional unitary group but not in the special unitary group, and maps by the symmetric square to an irreducible subgroup of the 3-dimensional real special orthogonal group. In an…
Computing a perturbative S-matrix through Feynman series in quantum field theory, the regularization used does not affect the final result. We propose a new approach to construction of the perturbative S-matrices, so that they will depend…
A pseudoclassical model for P,T-invariant system of topologically massive U(1) gauge fields is analyzed. The model demonstrates a nontrivial relationship between continuous and discrete symmetries and reveals a phenomenon of ``classical…
We study the possibility for a global unitary applied on an arbitrary number of qubits to be decomposed in a sequential unitary procedure, where an ancillary system is allowed to interact only once with each qubit. We prove that sequential…
Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…
Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a…
The standard treatment of neutrino oscillations usually relies on factorization which assumes neutrino production, propagation, and detection are independent processes. As a consequence, the total probability is given by the product of…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
Normals with unknown parameters (NUP) can be used to convert nontrivial model-based estimation problems into iterations of linear least-squares or Gaussian estimation problems. In this paper, we extend this approach by augmenting factor…
We consider the problem of recovering a unitary eigendecomposition of a complex unitary matrix from that of its embedded real-valued formulation. Such formulations arise naturally in scientific computing workflows that employ…
Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…
The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire…
The constraints implied by analyticity in two-dimensional factorised S-matrix theories are reviewed. Whenever the theory is not time-reversal invariant, it is argued that the familiar condition of `Real analyticity' for the S-matrix…
In this work we use the q-oscillator formalism to construct the atypical (short) supersymmetric representations of the centrally extended Uq (su(2|2)) algebra. We then determine the S-matrix describing the scattering of arbitrary bound…
Recently, the supersymmetry method was extended from Gaussian ensembles to arbitrary unitarily invariant matrix ensembles by generalizing the Hubbard-Stratonovich transformation. Here, we complete this extension by including arbitrary…
Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…
We consider compact matrix quantum groups whose $N$-dimensional fundamental representation decomposes into an $(N-1)$-dimensional and a one-dimensional subrepresentation. Even if we know that the compact matrix quantum group associated to…