Quantum 5, 437 (2021). https://doi.org/10.22331/q-2021-04-20-437 The $p$-stage Quantum Approximate Optimization Algorithm (QAOA$_p$) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but its theoretical behavior is not well understood beyond $p=1$. […]
Quantum 5, 436 (2021). https://doi.org/10.22331/q-2021-04-20-436 Suppose we want to implement a unitary $U$, for instance a circuit for some quantum algorithm. Suppose our actual implementation is a unitary $tilde{U}$, which we can only apply as […]
Quantum 5, 435 (2021). https://doi.org/10.22331/q-2021-04-20-435 We investigate the conditions under which an uncontrollable background processes may be harnessed by an agent to perform a task that would otherwise be impossible within their operational framework. This […]
Quantum 5, 434 (2021). https://doi.org/10.22331/q-2021-04-19-434 The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its […]
Quantum 5, 433 (2021). https://doi.org/10.22331/q-2021-04-15-433 We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler […]
Quantum 5, 432 (2021). https://doi.org/10.22331/q-2021-04-15-432 Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF). This decoder displays sub-optimal performance in practice and requires […]
Quantum 5, 431 (2021). https://doi.org/10.22331/q-2021-04-15-431 In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can […]
Quantum 5, 430 (2021). https://doi.org/10.22331/q-2021-04-14-430 In this work, we study a recently proposed operational measure of nonlocality by Fonseca and Parisio [Phys. Rev. A 92, 030101(R) (2015)] which describes the probability of violation of local […]
Quantum 5, 429 (2021). https://doi.org/10.22331/q-2021-04-08-429 A central tenet of theoretical cryptography is the study of the minimal assumptions required to implement a given cryptographic primitive. One such primitive is the one-time memory (OTM), introduced by […]
Quantum 5, 428 (2021). https://doi.org/10.22331/q-2021-04-08-428 In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case. GAS […]
Recent Comments