Related papers: Algorithm for computing canonical bases and foldin…
Difference sets are basic combinatorial structures that have applications in signal processing, coding theory, and cryptography. We consider the problem of identifying a shifted version of the characteristic function of a (known) difference…
Symmetry adapted bases in quantum chemistry and bases adapted to quantum information share a common characteristics: both of them are constructed from subspaces of the representation space of the group SO(3) or its double group (i.e.,…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
For an acyclic quiver, we establish a connection between the cohomology of quiver Grassmannians and the dual canonical bases of the algebra $U_q^-(\mathfrak{g})$, where $U_q^-(\mathfrak{g})$ is the negative half of the quantized enveloping…
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed…
This paper provides a short introduction to the mathematical foundation of quantum computation for researchers in computer science by providing an introduction fo the mathematical basis of calculations. This paper concerns the mathematical…
We develop invariant theory for the quantum group ${\rm U}_q$ of $G_2$ at generic $q$ in the setting of braided symmetric algebras. Let ${\mathcal A}_m$ be the braided symmetric algebra over $m$-copies of the $7$-dimensional simple ${\rm…
We show that the braid-group extension of the monodromy-based topological quantum computation scheme of Das Sarma et al. can be understood in terms of the universal R matrix for the Ising model giving similar results to those obtained by…
In this article, we discuss how a kind of hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Hartree-Fock electronic structure computation of molecules. In the proposed algorithm, we…
We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linearly-constrained, binary optimization problems on quantum annealers (QA). The computational premise of quantum computers…
We present a quantum-classical algorithm to study the dynamics of the two-spatial-site Schwinger model on IBM's quantum computers. Using rotational symmetries, total charge, and parity, the number of qubits needed to perform computation is…
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…
For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well-established in theory and experiment for the past 20 years. However, most constructions of these bases make…
We present a constructive proof that anyonic magnetic charges with fluxes in a non-solvable finite group can perform universal quantum computations. The gates are built out of the elementary operations of braiding, fusion, and vacuum pair…
Our starting point is a particular `canvas' aimed to `draw' theories of physics, which has symmetric monoidal categories as its mathematical backbone. In this paper we consider the conceptual foundations for this canvas, and how these can…
Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in $SU(2)_k$ quantum group theories, a rich source of examples of non-Abelian anyons such as the…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
Quantum computation offers a promising alternative to classical computing methods in many areas of numerical science, with algorithms that make use of the unique way in which quantum computers store and manipulate data often achieving…
We present the experimental quantum tomography of 7- and 8-dimensional quantum systems based on projective measurements in the mutually unbiased basis (MUB-QT). One of the advantages of MUB-QT is that it requires projections from a minimal…