Related papers: An Explicit Construction of Quantum Expanders
The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum…
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qubit basis-changing gate -- commonly chosen to be the…
We construct realizations of quantum generalized Verma modules for U_q(sl_n(C)) by quan- tum differential operators. Taking the classical limit q ! 1 provides a realization of classical generalized Verma modules for sl_n(C) by differential…
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
In this letter the explicit form of evolution operator of three atoms Tavis-Cummings model is given, which is a generalization of the paper quant-ph/0403008.
The purpose of this paper is to make the theory of vertex algebras trivial. We do this by setting up some categorical machinery so that vertex algebras are just ``singular commutative rings'' in a certain category. This makes it easy to…
We show that for any Hilbert-space dimension, the optimal universal quantum cloner can be constructed from essentially the same quantum circuit, i.e., we find a universal design for universal cloners. In the case of infinite dimensions…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor expanders, meaning bipartite graphs where small sets…
To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free…
A quantum computer is a hypothetical device in which the laws of quantum mechanics are used to introduce a degree of parallelism into computations and which could therefore significantly improve on the computational speed of a classical…
We provide a module-theoretic interpretation of the expansion formula given by Huang (2022), which defines a map on perfect matchings to compute the expansion of quantum cluster variables in quantum cluster algebras arising from unpunctured…
A formalism for the construction of some classes of Gazeau$-$Klauder squeezed states, corresponding to arbitrary solvable quantum systems with a known discrete spectrum, are introduced. As some physical applications, the proposed structure…
The factorization form of the integrands in the Cachazo-He-Yuan (CHY) formalism makes the generalized Kawai-Lewellen-Tye (KLT) relations manifest, thus amplitudes of one theory can be expanded in terms of the amplitudes of another theory.…
Quantum computing promises to solve problems beyond the reach of classical computers, but today's quantum hardware is error-prone and much slower than classical hardware. Every quantum operation is costly, making it crucial to minimize…
Quantum gauge theories with finite-dimensional representation spaces are constructed that can have canonical gauge field theories as singular limits. They describe nature as a recursive quantum assembly by iterating Fermi-Dirac…
Motivated by Iyama's higher representation theory, we introduce $n$-translation quivers and $n$-translation algebras. The classical $\mathbb Z Q$ construction of the translation quiver is generalized to construct an $(n+1)$-translation…
We show that noncommutative differential forms on $k[x]$, $k$ a field, are of the form $\Omega^1=k_\lambda[x]$ where $k_\lambda\supset k$ is a field extension. We compute the case $C\supset R$ explicitly, where $\Omega^1$ is 2-dimensional.…
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing…
An approach to study a generalization of the classical-quantum transition for general systems is proposed. In order to develop the idea, a deformation of the ladder operators algebra is proposed that contains a realization of the quantum…