Quantum 5, 403 (2021). https://doi.org/10.22331/q-2021-03-07-403 We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, […]
Quantum 5, 403 (2021). https://doi.org/10.22331/q-2021-03-07-403 We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, […]
Quantum 5, 402 (2021). https://doi.org/10.22331/q-2021-03-07-402 An $noverset{p}{mapsto}m$ random access code (RAC) is an encoding of $n$ bits into $m$ bits such that any initial bit can be recovered with probability at least $p$, while in […]
Quantum 5, 401 (2021). https://doi.org/10.22331/q-2021-03-02-401 Self-testing is a method to certify devices from the result of a Bell test. Although examples of noise tolerant self-testing are known, it is not clear how to deal efficiently […]
Quantum 5, 400 (2021). https://doi.org/10.22331/q-2021-02-24-400 The Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. Recently, this result has been generalized to cover inputs that […]
Quantum 5, 399 (2021). https://doi.org/10.22331/q-2021-02-22-399 Simulating the dynamics and the non-equilibrium steady state of an open quantum system are hard computational tasks on conventional computers. For the simulation of the time evolution, several efficient quantum […]
Quantum 5, 398 (2021). https://doi.org/10.22331/q-2021-02-17-398 It has long been known that long-ranged entangled topological phases can be exploited to protect quantum information against unwanted local errors. Indeed, conditions for intrinsic topological order are reminiscent of […]
Quantum 5, 397 (2021). https://doi.org/10.22331/q-2021-02-15-397 Quantum communication technologies show great promise for applications ranging from the secure transmission of secret messages to distributed quantum computing. Due to fiber losses, long-distance quantum communication requires the use […]
Quantum 5, 396 (2021). https://doi.org/10.22331/q-2021-02-15-396 For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information processing. An important aspect is implementing arbitrary […]
Quantum 5, 395 (2021). https://doi.org/10.22331/q-2021-02-11-395 Path integral quantum Monte Carlo (PIMC) is a method for estimating thermal equilibrium properties of stoquastic quantum spin systems by sampling from a classical Gibbs distribution using Markov chain Monte […]
Quantum 5, 394 (2021). https://doi.org/10.22331/q-2021-02-08-394 We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods […]
Recent Comments