Related papers: Quantum CPOs
One perspective on quantum algorithms is that they are classical algorithms having access to a special kind of memory with exotic properties. This perspective suggests that, even in the case of quantum algorithms, the control flow notions…
In this paper, we establish a q-analog of partial fraction decomposition formula. By using formula, we develop new closed form representations of sums of q-harmonic numbers and reciprocal q-binomial coefficients. Moreover, we give explicit…
This article consists of a short introduction to the quantum approximation optimisation algorithm (QAOA). The mathematical structure of the QAOA, as well as its basic properties, are described. The implementation of the QAOA on MaxCut…
Inclusions and extensions lie at the heart of physics and mathematics. The most relevant kind of inclusion in quantum systems is that of a von Neumann subalgebra, which is the focus of this work. We propose an object intrinsic to a given…
Identification of the optimal quantum metrological protocols in realistic many particle quantum models is in general a challenge that cannot be efficiently addressed by the state-of-the-art numerical and analytical methods. Here we provide…
This document describes a quantum assembly language (QASM) called OpenQASM that is used to implement experiments with low depth quantum circuits. OpenQASM represents universal physical circuits over the CNOT plus SU(2) basis with…
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ…
In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers…
Let C be the category of finite-dimensional representations of a quantum affine algebra of simply-laced type. We introduce certain monoidal subcategories C_l (l integer) of C and we study their Grothendieck rings using cluster algebras.
Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical…
As quantum computing architecture matures, it is important to investigate new technologies that lend unique advantages. In this work, we propose, Qompose, a neutral atom quantum computing framework for efficiently composing quantum circuits…
The Proto-Quipper family of programming languages aims to provide a formal foundation for the Quipper quantum programming language. Unfortunately, Proto-Quipper languages have complex operational semantics: they are inherently effectful,…
Quantum process tomography (QPT) plays a central role in characterizing quantum gates and circuits, diagnosing quantum devices, calibrating hardware, and supporting quantum error correction. However, conventional QPT methods face challenges…
The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill,…
Quantum machine learning (QML), which combines quantum computing with machine learning, is widely believed to hold the potential to outperform traditional machine learning in the era of noisy intermediate-scale quantum (NISQ). As one of the…
We introduce the notion of restricted dynamical quantum groups through their category of representations, which are monoidal categories with a forgetful functor to the category of $\pi$-graded vector spaces for a groupoid $\pi$.
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…
We derive a uniqueness result for non-Cartesian composition of systems in a large class of process theories, with important implications for quantum theory and linguistics. Specifically, we consider theories of wavefunctions valued in…
This paper introduces the quadratically-constrained quadratic programming (QCQP) framework recently added in HPIPM alongside the original quadratic-programming (QP) framework. The aim of the new framework is unchanged, namely providing the…
We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order…