Quantum 8, 1405 (2024). https://doi.org/10.22331/q-2024-07-10-1405 We propose an estimation procedure for $d$-dimensional unitary transformations. For $dgt2$, the unitary transformations close to the identity are estimated saturating the quantum Cramér-Rao bound. For $d=2$, the estimation of […]
Quantum 8, 1404 (2024). https://doi.org/10.22331/q-2024-07-10-1404 The classical embeddability problem asks whether a given stochastic matrix $T$, describing transition probabilities of a $d$-level system, can arise from the underlying homogeneous continuous-time Markov process. Here, we investigate […]
Quantum 8, 1403 (2024). https://doi.org/10.22331/q-2024-07-10-1403 The CSS code construction is a powerful framework used to express features of a quantum code in terms of a pair of underlying classical codes. Its subsystem extension allows for […]
Quantum 8, 1402 (2024). https://doi.org/10.22331/q-2024-07-10-1402 Communication complexity quantifies how difficult it is for two distant computers to evaluate a function $f(X,Y)$, where the strings $X$ and $Y$ are distributed to the first and second computer […]
Quantum 8, 1401 (2024). https://doi.org/10.22331/q-2024-07-10-1401 We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the […]
Quantum 8, 1400 (2024). https://doi.org/10.22331/q-2024-07-10-1400 Majorana zero modes (MZMs) are promising candidates for topologically-protected quantum computing hardware, however their large-scale use will likely require quantum error correction. Majorana surface codes (MSCs) have been proposed to […]
Quantum 8, 1399 (2024). https://doi.org/10.22331/q-2024-07-04-1399 Trapdoor claw-free functions (TCFs) are immensely valuable in cryptographic interactions between a classical client and a quantum server. Typically, a protocol has the quantum server prepare a superposition of two-bit […]
Quantum 8, 1398 (2024). https://doi.org/10.22331/q-2024-07-04-1398 We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are $good$ in that they exhibit constant rate […]
Quantum 8, 1397 (2024). https://doi.org/10.22331/q-2024-07-04-1397 Measurement-Based Quantum Computation (MBQC) is a model of quantum computation, which uses local measurements instead of unitary gates. Here we explain that the MBQC procedure has a fundamental basis in […]
Quantum 8, 1396 (2024). https://doi.org/10.22331/q-2024-07-03-1396 The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial […]
Recent Comments