Quantum 5, 595 (2021). https://doi.org/10.22331/q-2021-12-02-595 In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for […]
Category: singularityhub
Quantum 5, 594 (2021). https://doi.org/10.22331/q-2021-11-29-594 Spontaneous collapse models and Bohmian mechanics are two different solutions to the measurement problem plaguing orthodox quantum mechanics. They have, a priori nothing in common. At a formal level, collapse […]
Quantum 5, 593 (2021). https://doi.org/10.22331/q-2021-11-29-593 The construction of Bell inequalities based on Platonic and Archimedean solids (Quantum 4 (2020), 293) is generalized to the case of orbits generated by the action of some finite groups. […]
Quantum 5, 592 (2021). https://doi.org/10.22331/q-2021-11-26-592 Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum […]
Quantum 5, 591 (2021). https://doi.org/10.22331/q-2021-11-25-591 We investigate the interplay between Aharonov-Bohm (AB) caging and topological protection in a family of quasi-one-dimensional topological insulators, which we term CSSH ladders. Hybrids of the Creutz ladder and the […]
Quantum 5, 590 (2021). https://doi.org/10.22331/q-2021-11-25-590 Quantum dynamics of driven open systems should be compatible with both quantum mechanic and thermodynamic principles. By formulating the thermodynamic principles in terms of a set of postulates we obtain […]
Quantum 5, 589 (2021). https://doi.org/10.22331/q-2021-11-25-589 We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we […]
Quantum 5, 588 (2021). https://doi.org/10.22331/q-2021-11-25-588 Gleason-type theorems for quantum theory allow one to recover the quantum state space by assuming that (i) states consistently assign probabilities to measurement outcomes and that (ii) there is a […]
Quantum 5, 587 (2021). https://doi.org/10.22331/q-2021-11-24-587 We present two new results about exact learning by quantum computers. First, we show how to exactly learn a $k$-Fourier-sparse $n$-bit Boolean function from $O(k^{1.5}(log k)^2)$ uniform quantum examples for […]
Quantum 5, 586 (2021). https://doi.org/10.22331/q-2021-11-23-586 We present a new tensor network algorithm for calculating the partition function of interacting quantum field theories in 2 dimensions. It is based on the Tensor Renormalization Group (TRG) protocol, […]
Recent Comments