Quantum 5, 604 (2021). https://doi.org/10.22331/q-2021-12-16-604 We define two dual tensor network representations of the (3+1)d toric code ground state subspace. These two representations, which are obtained by initially imposing either family of stabilizer constraints, are […]
Quantum 5, 603 (2021). https://doi.org/10.22331/q-2021-12-16-603 Cryptography with quantum states exhibits a number of surprising and counterintuitive features. In a 2002 work, Barnum et al. argue that these features imply that digital signatures for quantum states […]
Quantum 5, 602 (2021). https://doi.org/10.22331/q-2021-12-07-602 The decoy-state method in quantum key distribution (QKD) is a popular technique to approximately achieve the performance of ideal single-photon sources by means of simpler and practical laser sources. In […]
Quantum 5, 601 (2021). https://doi.org/10.22331/q-2021-12-07-601 Topology in general but also topological objects such as monopoles are a central concept in physics. They are prime examples for the intriguing physics of gauge theories and topological states […]
Quantum 5, 600 (2021). https://doi.org/10.22331/q-2021-12-07-600 Completely positive and trace-preserving maps characterize physically implementable quantum operations. On the other hand, general linear maps, such as positive but not completely positive maps, which can not be physically […]
Quantum 5, 599 (2021). https://doi.org/10.22331/q-2021-12-06-599 Incompatible observables underlie pillars of quantum physics such as contextuality and entanglement. The Heisenberg uncertainty principle is a fundamental limitation on the measurement of the product of incompatible observables, a […]
Quantum 5, 598 (2021). https://doi.org/10.22331/q-2021-12-06-598 We demonstrate characterizing quantum evolutions via matrix factorization algorithm, a particular type of the recommender system (RS). A system undergoing a quantum evolution can be characterized in several ways. Here […]
Quantum 5, 597 (2021). https://doi.org/10.22331/q-2021-12-06-597 We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation. Click to rate this post! [Total: 0 […]
Quantum 5, 596 (2021). https://doi.org/10.22331/q-2021-12-02-596 Variational quantum eigensolvers (VQEs) are a promising class of quantum algorithms for preparing approximate ground states in near-term quantum devices. Minimizing the error in such an approximation requires designing ansatzes […]
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 […]
Recent Comments