Quantum 5, 566 (2021). https://doi.org/10.22331/q-2021-10-19-566 We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of […]
Quantum 5, 566 (2021). https://doi.org/10.22331/q-2021-10-19-566 We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of […]
Quantum 5, 565 (2021). https://doi.org/10.22331/q-2021-10-19-565 Photonic cluster states are a powerful resource for measurement-based quantum computing and loss-tolerant quantum communication. Proposals to generate multi-dimensional lattice cluster states have identified coupled spin-photon interfaces, spin-ancilla systems, and […]
Quantum 5, 564 (2021). https://doi.org/10.22331/q-2021-10-19-564 We present a quantum error correcting code with $textit{dynamically generated logical qubits}$. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, our measurement patterns generate logical […]
Quantum 5, 563 (2021). https://doi.org/10.22331/q-2021-10-19-563 We study the quantum-classical correspondence of an experimentally accessible system of interacting bosons in a tilted triple-well potential. With the semiclassical analysis, we get a better understanding of the different […]
Quantum 5, 562 (2021). https://doi.org/10.22331/q-2021-10-14-562 Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits. However, they are impacted by […]
Quantum 5, 561 (2021). https://doi.org/10.22331/q-2021-10-07-561 Entanglement in symmetric quantum states and the theory of copositive matrices are intimately related concepts. For the simplest symmetric states, i.e., the diagonal symmetric (DS) states, it has been shown […]
Quantum 5, 560 (2021). https://doi.org/10.22331/q-2021-10-07-560 A leading proposal for verifying near-term quantum supremacy experiments on noisy random quantum circuits is linear cross-entropy benchmarking. For a quantum circuit $C$ on $n$ qubits and a sample $z […]
Quantum 5, 559 (2021). https://doi.org/10.22331/q-2021-10-06-559 To explore the possibilities of a near-term intermediate-scale quantum algorithm and long-term fault-tolerant quantum computing, a fast and versatile quantum circuit simulator is needed. Here, we introduce Qulacs, a fast […]
Quantum 5, 558 (2021). https://doi.org/10.22331/q-2021-10-05-558 Barren plateau landscapes correspond to gradients that vanish exponentially in the number of qubits. Such landscapes have been demonstrated for variational quantum algorithms and quantum neural networks with either deep […]
Quantum 5, 557 (2021). https://doi.org/10.22331/q-2021-10-05-557 Gate set tomography (GST) is a protocol for detailed, predictive characterization of logic operations (gates) on quantum computing processors. Early versions of GST emerged around 2012-13, and since then it […]
Recent Comments