Related papers: Exploring quantum teleportation through unitary er…
The topics of the paper are: a) Some anti-linear maps governing EPR tasks if no reference bases are distinguished. b) Imperfect teleportation and the composition rule. The ancilla is supposed pure but otherwise arbitrary. c) Quantum…
The teleportation model of quantum computation introduced by Gottesman and Chuang (1999) motivated the development of the Clifford hierarchy. Despite its intrinsic value for quantum computing, the widespread use of magic state distillation,…
It is shown that there exists a mapping between the fermions of the Standard Model (SM) represented as braids in the Bilson-Thompson model, and a set of gates which can perform Universal Quantum Computation (UQC). This leads us to…
We present a unified approach to quantum teleportation in arbitrary dimensions based on the Wigner-function formalism. This approach provides us with a clear picture of all manipulations performed in the teleportation protocol. In addition…
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a…
Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators. We propose several extensions of the…
We investigate the tomography of unknown unitary quantum processes within the framework of a finite-dimensional Wigner-type representation. This representation provides a rich visualization of quantum operators by depicting them as shapes…
Extending upon the observations of the emergence of quantum-like states from classical complex synchronized networks, this work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the…
We show that many tame modules of the quantum toroidal $\mathfrak{gl}_2$ algebra can be explicitly constructed in a purely combinatorial way using the theory of $q$-characters. The examples include families of evaluation modules obtained…
In the framework of the algebraic formulation, we discuss and analyse some new features of the local structure of a real scalar quantum field theory in a strongly causal spacetime. In particular we use the properties of the exponential map…
In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially…
A formalism for quantum error correction based on operator algebras was introduced in [1] via consideration of the Heisenberg picture for quantum dynamics. The resulting theory allows for the correction of hybrid quantum-classical…
We show that the multiplicative domain of a completely positive map yields a new class of quantum error correcting codes. In the case of a unital quantum channel, these are precisely the codes that do not require a measurement as part of…
From the set of operators for errors and its correction code, we introduce the so-called complete unitary transformation. It can be used for encoding while the inverse of it can be applied for correcting the errors of the encoded qubit. We…
Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. A key issue is how to address the inherent non-linearity of classical deep learning, a problem in the quantum domain due to…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…
This paper explores of the role of unitary braiding operators in quantum computing. We show that a single specific solution R (the Bell basis change matrix) of the Yang-Baxter Equation is a universal gate for quantum computing, in the…
We present for the first time a general theory of error correction for permutation invariant (PI) codes. Using representation theory of the symmetric group we construct efficient algorithms that can correct any correctible error on any PI…
What does it take for real-deterministic c-valued (i.e., classical, commuting) variables to comply with the Heisenberg uncertainty principle? Here, we construct a class of real-deterministic c-valued variables out of the weak values…