Quantum 6, 613 (2022). https://doi.org/10.22331/q-2022-01-03-613 Most quantum key distribution (QKD) protocols can be classified as either a discrete-variable (DV) protocol or continuous-variable (CV) protocol, based on how classical information is being encoded. We propose a […]
Quantum 5, 612 (2021). https://doi.org/10.22331/q-2021-12-28-612 We introduce the concepts of a symmetry-protected sign problem and symmetry-protected magic to study the complexity of symmetry-protected topological (SPT) phases of matter. In particular, we say a state has […]
Quantum 5, 611 (2021). https://doi.org/10.22331/q-2021-12-23-611 The indistinguishability of quantum particles is widely used as a resource for the generation of entanglement. Linear quantum networks (LQNs), in which identical particles linearly evolve to arrive at multimode […]
Quantum 5, 610 (2021). https://doi.org/10.22331/q-2021-12-23-610 Coherent driving has established itself as a powerful tool for guiding a many-body quantum system into a desirable, coherent non-equilibrium state. A thermodynamically large system will, however, almost always saturate […]
Quantum 5, 609 (2021). https://doi.org/10.22331/q-2021-12-23-609 The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation […]
Quantum 5, 608 (2021). https://doi.org/10.22331/q-2021-12-23-608 We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after […]
Quantum 5, 607 (2021). https://doi.org/10.22331/q-2021-12-23-607 Quantum dot-based quantum computation employs extensively the exchange interaction between nearby electronic spins in order to manipulate and couple different qubits. The exchange interaction, however, couples the qubit states to […]
Quantum 5, 606 (2021). https://doi.org/10.22331/q-2021-12-20-606 In this work we improve the runtime of recent classical algorithms for strong simulation of quantum circuits composed of Clifford and T gates. The improvement is obtained by establishing a […]
Quantum 5, 605 (2021). https://doi.org/10.22331/q-2021-12-20-605 Recently, Hastings & Haah introduced a quantum memory defined on the honeycomb lattice. Remarkably, this honeycomb code assembles weight-six parity checks using only two-local measurements. The sparse connectivity and two-local […]
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 […]
Recent Comments