Related papers: Quantum space, ground space traversal, and how to …
In the quantum computation verification problem, a quantum server wants to convince a client that the output of evaluating a quantum circuit $C$ is some result that it claims. This problem is considered very important both theoretically and…
We experimentally demonstrate a reconfigurable quantum network architecture suitable for integrating satellite links in metropolitan quantum networks. The network architecture is designed such that once a satellite is in range, it is…
A practical fault-tolerant quantum computer is worth looking forward to as it provides applications that outperform their known classical counterparts. However, millions of interacting qubits with stringent criteria are required, which is…
In recent years, quantum computing has promised a revolution in computing performance, based on massive parallelism enabled by many entangled qubits. Josephson junction integrated circuits have emerged as the key technology to implement…
Quantum communication rates in terrestrial quantum networks are fundamentally limited by fibre loss, even in the presence of quantum repeaters. Satellites offer a solution for long-distance communication, with the most commonly explored…
We present an algorithm to simulate two-dimensional quantum lattice systems in the thermodynamic limit. Our approach builds on the {\em projected entangled-pair state} algorithm for finite lattice systems [F. Verstraete and J.I. Cirac,…
Classical simulation of quantum computation has often been viewed as the method to determine where the horizon of quantum supremacy is located---that is, where quantum computation can no longer be simulated by classical methods. As of now,…
The optimal quantum communication cost of computing a classical sum of distributed sources is studied over a quantum erasure multiple access channel (QEMAC). K classical messages comprised of finite-field symbols are distributed across $S$…
Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advancements towards FTQC across leading…
We continue the study of spherically symmetric vacuum space-times in loop quantum gravity by treating the interior of a black hole. We start from a midi-superspace approach, but a simple gauge fixing leads to a Kantowski--Sachs form for the…
We show a dichotomy result for $p$-pass streaming algorithms for all CSPs and for up to polynomially many passes. More precisely, we prove that for any arity parameter $k$, finite alphabet $\Sigma$, collection $\mathcal{F}$ of $k$-ary…
We consider a hypothetical apparatus that implements measurements for arbitrary 4-local quantum observables A on n qubits. The apparatus implements the ``measurement algorithm'' after receiving a classical description of A. We show that a…
Quantum Computing (QC) has gained immense popularity as a potential solution to deal with the ever-increasing size of data and associated challenges leveraging the concept of quantum random access memory (QRAM). QC promises quadratic or…
Quantum coherence has received significant attention in recent years, but its study is mostly conducted in single party settings. In this paper, we generalize important results in multipartite entanglement theory to their counterparts in…
We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal…
As quantum networking hardware remains costly and not yet widely accessible, simulation tools are essential for the design and evaluation of quantum network architectures and protocols. However, designing a scalable and computationally…
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely…
We introduce the {\em certification} of solutions to graph problems when access to the input is restricted. This topic has received a lot of attention in the distributed computing setting, and we introduce it here in the context of…
Recently, a standardized framework was proposed for introducing quantum-inspired moves in mathematical games with perfect information and no chance. The beauty of quantum games-succinct in representation, rich in structures, explosive in…
Nowadays, quantum simulation schemes come in two flavours. Either they are continuous-time discrete-space models (a.k.a Hamiltonian-based), pertaining to non-relativistic quantum mechanics. Or they are discrete-spacetime models (a.k.a…