Related papers: Genuinely quantum SudoQ and its cardinality
Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard,…
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…
We provide two simple universality criteria. Our first criterion states that $\mathcal{S}\subset G_d:=U(d)$ is universal if and only if $\mathcal{S}$ forms a $\delta$-approximate $t(d)$-design, where $t(2)=6$ and $t(d)=4$ for $d\geq3$. Our…
We study a generalization of the Mermin-Peres magic square game to arbitrary rectangular dimensions. After exhibiting some general properties, these rectangular games are fully characterized in terms of their optimal win probabilities for…
We initiate the study of parameterized complexity of $\textsf{QMA}$ problems in terms of the number of non-Clifford gates in the problem description. We show that for the problem of parameterized quantum circuit satisfiability, there exists…
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
We introduce a measure of quantum correlations in the $N$-qubit quantum system which is invariant with respect to the $SU(2^N)$ group of transformations of this system. This measure is a modification of the quantum discord introduced…
A scalar field theory with 4-derivative kinetic terms and 4-derivative cubic and quartic couplings is presented as a proxy for quantum quadratic gravity (QQG). The scalar theory is renormalizable and asymptotically free and the remaining…
A quantum board game is a multi-round protocol between a single quantum player against the quantum board. Molina and Watrous discovered quantum hedging. They gave an example for perfect quantum hedging: a board game with winning probability…
This work is aimed at demonstrating the possibility to construct new exactly-solvable stochastic systems by use of the extended supersymmetric quantum mechanics ($N=4 SUSY QM$) formalism. A feature of the proposed approach consists in $N=4…
Consider a function f which is defined on the integers from 1 to N and takes the values -1 and +1. The parity of f is the product over all x from 1 to N of f(x). With no further information about f, to classically determine the parity of f…
The emergence of quantum technologies is heating up the debate on quantum supremacy, usually focusing on the feasibility of looking good on paper algorithms in realistic settings, due to the vulnerability of quantum systems to myriad…
We study the quantum fate of a naked curvature singularity sourced by a scalar field via several methods and compare the results obtained. The first method relies on relativistic quantum mechanics on a fixed background employing the…
We reformulate a fundamental result due to Cook, Harbourne, Migliore and Nagel on the existence and irreduciblity of unexpected plane curves of a set of points $Z$ in $\mathbb{P}^2$, using the minimal degree of a Jacobian syzygy of the…
Dynamical triangulations of four-dimensional Euclidean quantum gravity give rise to an interesting, numerically accessible model of quantum gravity. We give a simple introduction to the model and discuss two particularly important issues.…
It is well-known that the winning region of a parity game with $n$ nodes and $k$ priorities can be computed as a $k$-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in…
PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\in\{0,1,...,n-1\}$ with the $x^{\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to…