Related papers: Quantum Polymorphisms and the Complexity of Quantu…
Quantum deformations of sets of points of the real and the complexified projective line are constructed. These deformations depend on the deformation parameter q and certain further parameters \lambda_{ij}. The deformations for which the…
The formalism of covariant quantum theory, introduced by Reisenberger and Rovelli, casts the description of quantum states and evolution into a framework compatable with the principles of general relativity. The leap to this covariant…
Two singularity theorems can be proven if one attempts to let a Lorentzian cobordism interpolate between two topologically distinct manifolds. On the other hand, Cartier and DeWitt-Morette have given a rigorous definition for quantum field…
Past years have seen the development of a few proposals for quantum extensions of process calculi. The rationale is clear: with the development of quantum communication protocols, there is a need to abstract and focus on the basic features…
Significant developments made in quantum hardware and error correction recently have been driving quantum computing towards practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications…
One of the main achievements of LQG is the consistent quantization of the Wheeler-DeWitt equation which is free of UV problems. However, ambiguities associated to the intermediate regularization procedure lead to an apparently infinite set…
We present the architectural design and prototype implementation of QUT (Quantum Unit Testing), a framework for unit testing of quantum subroutines. The framework is developed with a focus on usability and simplicity, making the complex…
We present a simple geometric construction linking geometric to deformation quantization. Both theories depend on some apparently arbitrary parameters, most importantly a polarization and a symplectic connection, and for real polarizations…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
Contextuality, a generalization of non-locality, has been proposed as the resource that provides the computational speed-up for quantum computation. For universal quantum computation using qudits, of odd-prime dimension, contextuality has…
We present a uniform framework for the treatment of a large class of toy models of quantum theory. Specifically, we will be interested in theories of wavefunctions valued in commutative involutive semirings, and which give rise to some…
Complexity theory traditionally studies the hardness of solving classical computational problems. In the quantum setting, it is also natural to consider a different notion of complexity, namely the complexity of physically preparing a…
A finite dimensional system with a quadratic Hamiltonian constraint is Dirac quantized in holomorphic, antiholomorphic and mixed representations. A unique inner product is found by imposing Hermitian conjugacy relations on an operator…
We establish that by parameterizing the configuration space of a one-dimensional quantum system by polynomial invariants of q-deformed Coxeter groups it is possible to construct exactly solvable models of Calogero type. We adopt the…
Fix a finite group $G$. We analyze the computational complexity of the problem of counting homomorphisms $\pi_1(X) \to G$, where $X$ is a topological space treated as computational input. We are especially interested in requiring $G$ to be…
Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is…
This paper presents an elementary introduction to Consistent Quantum Theory (CQT), as developed by Griffiths and others over the past 25 years. The theory is a version of orthodox(Copenhagen) quantum mechanics, based on the notion that the…
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish a quantum equivalent of classical parameterized complexity…
Although an important issue in canonical quantization, the problem of representing the constraint algebra in the loop representation of quantum gravity has received little attention. The only explicit computation was performed by Gambini,…
We prove that the isomorphism problem is decidable for generalized Baumslag-Solitar (GBS) groups with one quasi-conjugacy class and full support gaps. In order to do so we introduce a family of invariants that fully characterize the…