Related papers: Distribution of interference in random quantum alg…
This paper studies information-theoretically secure quantum homomorphic encryption (QHE) schemes of classical data. Previous works on information-theoretically secure QHE schemes (like Childs'05, Liang'13, and others) are typically based on…
Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are…
Amplitude amplification is one of primary tools in building algorithms for quantum computers. This technique generalizes key ideas of the Grover search algorithm. Potentially useful modifications are connected with changing phases in the…
We present a classical algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates. We achieve the promotion…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms and will become more relevant as an essential building block for quantum error correction. However, mid-circuit…
We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be PAC-learned with…
What is the role of coherence in determining the distribution of work done on a quantum system? We approach this question from an operational perspective and consider a setup in which the internal energy of a closed system is recorded by a…
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…
The problem of the quantitative degradation of the performance of a quantum computer due to noisy unitary gates (imperfect external control) is studied. It is shown that quite general conclusions on the evolution of the fidelity can be…
We analyze the optimal basis for generating the maximum relative entropy of quantum coherence by an arbitrary gate on a two-qubit system. The optimal basis is not unique, and the high quantum coherence generating gates are also typically…
The existence of pseudorandom unitaries (PRUs) -- efficient quantum circuits that are computationally indistinguishable from Haar-random unitaries -- has been a central open question, with significant implications for cryptography,…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
Error mitigation is essential for near-term quantum devices, and two promising techniques are universal frame randomization and Randomized Compilation. These methods insert random twirling gates into a circuit to reduce errors while…
We propose and demonstrate a technique for quantum random number generation based on the random population of the output spatial modes of a beam splitter when both inputs are simultaneously fed with indistinguishable weak coherent states.…
Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ)…
Quantum counterparts of certain simple classical systems can exhibit chaotic behaviour through the statistics of their energy levels and the irregular spectra of chaotic systems are modelled by eigenvalues of infinite random matrices. We…
Lately, much attention has been given to quantum algorithms that solve pattern recognition tasks in machine learning. Many of these quantum machine learning algorithms try to implement classical models on large-scale universal quantum…
We present a benchmarking protocol for universal quantum computers, achieved through the simulation of random dynamical quantum maps. This protocol provides a holistic assessment of system-wide error rates, encapsulating both gate…