相关论文: Estimating Jones polynomials is a complete problem…

The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationally universal quantum medium. For genus $=0$…

This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our…

This paper explores the potential benefits of quantum coherence and quantum discord in the non-universal quantum computing model called deterministic quantum computing with one qubit (DQC1) in supervised machine learning. We show that the…

We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements…

In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…

Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this potential is by reformulating combinatorial problems as a…

We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the…

Quantum computer is extensively used in solving financial problems. Quantum amplitude estimation, an algorithm that aims to estimate the amplitude of a given quantum state, can be utilized to determine the expectation value of bonds as the…

We provide an elementary introduction to topological quantum computation based on the Jones representation of the braid group. We first cover the Burau representation and Alexander polynomial. Then we discuss the Jones representation and…

We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…

Assuming a cloning oracle, satisfiability, which is an NP complete problem, is shown to belong to $BPP^C$ and $BQP^C$ (depending on the ability of the oracle C to clone either a binary random variable or a qubit). The same result is…

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…

We consider the problem of optimal processing of quantum information at incomplete experimental data characterizing the quantum source. In particular, we then prove that for one-qubit quantum source the Jaynes principle offers a simple…

A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…

We examine the structure and dimensionality of the Jones polynomial using manifold learning techniques. Our data set consists of more than 10 million knots up to 17 crossings and two other special families up to 2001 crossings. We introduce…

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…

Quantum computers hold great promise to enhance machine learning, but their current qubit counts restrict the realisation of this promise. In an attempt to placate this limitation techniques can be applied for evaluating a quantum circuit…

We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum…

A quantum circuit must be preprocessed before implementing on NISQ devices due to the connectivity constraint. Quantum circuit mapping (QCM) transforms the circuit into an equivalent one that is compliant with the NISQ device's architecture…

A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems…