相关论文: On the complexity of approximating the diamond nor…

Quantum correlation often refers to correlations exhibited by two or more local subsystems under a suitable measurement. These correlations are beyond the framework of classical statistics and the associated classical probability…

State conversion generalizes query complexity to the problem of converting between two input-dependent quantum states by making queries to the input. We characterize the complexity of this problem by introducing a natural…

Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds…

Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably.…

An algorithm is proposed which transfers the quantum information of a wave function (analogue signal) into a register of qubits (digital signal) such that $n$ qubits describe the amplitudes and phases of $2^n$ points of a sufficiently…

Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…

The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…

The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. We develop a general approach to this…

A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of `magic' quantum states. In this context, we develop a general…

The distinguishability between two quantum states can be defined in terms of their trace distance. The operational meaning of this definition involves a maximization over measurement projectors. Here we introduce an alternative definition…

The problem of quantifying the difference between evolutions of an open quantum system (in particular, between the actual evolution of an open system and the ideal target operation on the corresponding closed system) is important in quantum…

As in classical reversible computing, Quantum Arithmetic is typically seen as a set of tools that process binary data encoded into a quantum register to set the value of another quantum register. This article presents another approach to…

Crystal strain variation imposes significant limitations on many quantum sensing and information applications for solid-state defect qubits in diamond. Thus, precision measurement and control of diamond crystal strain is a key challenge.…

Reducing the complexity of quantum algorithms to treat quantum chemistry problems is essential to demonstrate an eventual quantum advantage of Noisy-Intermediate Scale Quantum (NISQ) devices over their classical counterpart. Significant…

Quantum measurement and quantum operation theory is developed here by taking the relational properties among quantum systems, instead of the independent properties of a quantum system, as the most fundamental elements. By studying how the…

Quantum dot arrays possess ground states governed by Coulomb energies, utilized prominently by singly occupied quantum dots, each implementing a spin qubit. For such quantum processors, the controlled transitions between ground states are…

The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we test their behavior? In other words, is quantum mechanics…

Quantum machine learning is one of the many potential applications of quantum computing, each of which is hoped to provide some novel computational advantage. However, quantum machine learning applications often fail to outperform classical…

It is shown how dual space diagrammatic representation of momentum integrals corresponding to triangle ladder diagrams with an arbitrary number of rungs can be transformed to half-diamonds. In paper arXiv:0803.3420 [hep-th] the…

We describe the use of quantum process calculus to describe and analyze quantum communication protocols, following the successful field of formal methods from classical computer science. The key idea is to define two systems, one modelling…