Related papers: Linear gate bounds against natural functions for p…
Quantum error correcting codes protect quantum computation from errors caused by decoherence and other noise. Here we study the problem of designing logical operations for quantum error correcting codes. We present an automated procedure…
We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing…
Quantum processes, such as quantum circuits, quantum memories, and quantum channels, are essential ingredients in almost all quantum information processing tasks. However, the characterization of these processes remains a daunting task due…
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined…
We define a class of stochastic processes based on evolutions and measurements of quantum systems, and consider the complexity of predicting their long-term behavior. It is shown that a very general class of decision problems regarding…
Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
Quantum Process Tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources making it impractical for more than 2-qubit systems. This work proposes an alternative approach that requires…
The performance of a quantum information processor depends on the precise control of phases introduced into the system during quantum gate operations. As the number of operations increases with the complexity of a computation, the phases of…
We propose an approach to quantum computing in which quantum gate strengths are parametrized by quantum degrees of freedom, and the capability of the quantum computer to perform desired tasks is monitored and gradually improved by…
Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be…
Unitarity randomized benchmarking (URB) is an experimental procedure for estimating the coherence of implemented quantum gates independently of state preparation and measurement errors. These estimates of the coherence are measured by the…
Efficient verification of quantum states and gates is crucial to the development of quantum technologies. Although the sample complexities of quantum state verification and quantum gate verification have been studied by many researchers,…
As quantum circuits become more integrated and complex, additional error sources that were previously insignificant start to emerge. Consequently, the fidelity of quantum gates benchmarked under pristine conditions falls short of predicting…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
We show that the algorithmic complexity of any classical algorithm written in a Turing-complete programming language polynomially bounds the number of quantum bits that are required to run and even symbolically execute the algorithm on a…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
Determining the position of an entity is a fundamental prerequisite for nearly all activities. Classical means, however, have been proven incapable of providing secure position verification, meaning that a prover can mislead verifiers about…
As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. Here we consider the natural problem of, given a circuit $C$,…