Related papers: Two-message quantum interactive proofs are in PSPA…
We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even…
We solve the master equations of two charged qubits measured by two serially coupled quantum point contacts (QPCs). We describe two-qubit dynamics by comparing entangled states with product states, and show that the QPC current can be used…
This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing…
We introduce Exchange Quantum Polynomial Time (XQP) circuits, which comprise quantum computation using only computational basis SPAM and the isotropic Heisenberg exchange interaction. Structurally, this sub-universal model captures…
In this work we consider the interplay between multiprover interactive proofs, quantum entanglement, and zero knowledge proofs - notions that are central pillars of complexity theory, quantum information and cryptography. In particular, we…
For approximate inference in the generalized quadratic equations model, many state-of-the-art algorithms lack any prior knowledge of the target signal structure, exhibits slow convergence, and can not handle any analytic prior knowledge of…
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…
Quantum communication has been leading the way of many remarkable theoretical results and experimental tests in physics. In this context, quantum communication complexity (QCC) has recently drawn earnest research attention as a tool to…
We introduce QICS (Quantum Information Conic Solver), an open-source primal-dual interior point solver fully implemented in Python, which is focused on solving optimization problems arising in quantum information theory. QICS has the…
With advances in quantum computing, researchers can now write and run many quantum programs. However, there is still a lack of effective methods for debugging quantum programs. In this paper, quantum symbolic execution (QSE) is proposed to…
Nowadays quantum SWAP gate has become an integral part of quantum computing, so investigation of methods of its realization seems to be an important practical problem for various quantum-optical and information applications. In the present…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
During the last ten years, superconducting circuits have passed from being interesting physical devices to becoming contenders for near-future useful and scalable quantum information processing (QIP). Advanced quantum simulation experiments…
A continuous variable controlled quantum dialogue scheme is proposed. The scheme is further modified to obtain two other protocols of continuous variable secure multiparty computation. The first one of these protocols provides a solution of…
The symmetrized quartic polynomial oscillator is shown to admit an sl(2,$\R$) algebraization. Some simple quasi-exactly solvable (QES) solutions are exhibited. A new symmetrized sextic polynomial oscillator is introduced and proved to be…
Mahadev [SIAM J. Comput. 2022] introduced the first protocol for classical verification of quantum computation based on the Learning-with-Errors (LWE) assumption, achieving a 4-message interactive scheme. This breakthrough naturally raised…
We combine the ideas of qubit encoding and dispersive dynamics to enable robust and easy quantum information processing (QIP) on paired superconducting charge boxes sharing a common bias lead. We establish a decoherence free subspace on…
The most promising applications of quantum computing are centered around solving search and optimization tasks, particularly in fields such as physics simulations, quantum chemistry, and finance. However, the current quantum software…
We start with the observation that the quantum group SL_q(2), described in terms of its algebra of functions has a quantum subgroup, which is just a usual Cartan group. Based on this observation we develop a general method of constructing…
Indefinite quadratic programs (QPs) are known to be very difficult to be solved to global optimality, so are linear programs with linear complementarity constraints. Treating the former as a subclass of the latter, this paper presents a…