Quantum

Paper

Fractalizing quantum codes

Trithep Devakul and Dominic J. Williamson,

Quantum 5, 438 (2021).

We introduce "fractalization", a procedure by which spin models are extended to higher-dimensional "fractal" spin models. This allows us to interpret type-II fracton phases, fractal symmetry…

Paper

Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs

Kunal Marwaha,

Quantum 5, 437 (2021).

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…

Paper

Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit

Noah Linden and Ronald de Wolf,

Quantum 5, 436 (2021).

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 a black-box.…

Paper

Resource theories of multi-time processes: A window into quantum non-Markovianity

Graeme D. Berk, Andrew J. P. Garner, Benjamin Yadin, Kavan Modi, and Felix A. Pollock,

Quantum 5, 435 (2021).

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 fr…

Paper

Expressibility of the alternating layered ansatz for quantum computation

Kouhei Nakaji and Naoki Yamamoto,

Quantum 5, 434 (2021).

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 i…

Paper

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Craig Gidney and Martin Ekerå,

Quantum 5, 433 (2021).

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, Za…

Paper

Combining hard and soft decoders for hypergraph product codes

Antoine Grospellier, Lucien Grouès, Anirudh Krishna, and Anthony Leverrier,

Quantum 5, 432 (2021).

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…

Paper

Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations

Juan José García-Ripoll,

Quantum 5, 431 (2021).

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 fami…

Paper

Experimentally friendly approach towards nonlocal correlations in multisetting N-partite Bell scenarios

Artur Barasiński, Antonín Černoch, Wiesław Laskowski, Karel Lemr, Tamás Vértesi, and Jan Soubusta,

Quantum 5, 430 (2021).

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…

Paper

Towards Quantum One-Time Memories from Stateless Hardware

Anne Broadbent, Sevag Gharibian, and Hong-Sheng Zhou,

Quantum 5, 429 (2021).

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), in…

Paper

Grover Adaptive Search for Constrained Polynomial Binary Optimization

Austin Gilliam, Stefan Woerner, and Constantin Gonciulea,

Quantum 5, 428 (2021).

In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) pr…

Paper

Quantum algorithms for Second-Order Cone Programming and Support Vector Machines

Iordanis Kerenidis, Anupam Prakash, and Dániel Szilágyi,

Quantum 5, 427 (2021).

We present a quantum interior-point method (IPM) for second-order cone programming (SOCP) that runs in time…

Paper

Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion

Amir Kalev and Itay Hen,

Quantum 5, 426 (2021).

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its…

Paper

Multiple-shot and unambiguous discrimination of von Neumann measurements

Zbigniew Puchała, Łukasz Pawela, Aleksandra Krawiec, Ryszard Kukulski, and Michał Oszmaniec,

Quantum 5, 425 (2021).

We present an in-depth study of the problem of multiple-shot discrimination of von Neumann measurements in finite-dimensional Hilbert spaces. Specifically, we consider two scenarios: minimum…

Paper

A universal scheme for robust self-testing in the prepare-and-measure scenario

Nikolai Miklin and Michał Oszmaniec,

Quantum 5, 424 (2021).

We consider the problem of certification of arbitrary ensembles of pure states and projective measurements solely from the experimental statistics in the prepare-and-measure scenario assumin…

Paper

Distinguishing noisy boson sampling from classical simulations

Valery Shchesnovich,

Quantum 5, 423 (2021).

Giving a convincing experimental evidence of the quantum supremacy over classical simulations is a challenging goal. Noise is considered to be the main problem in such a demonstration, hence…

Category: Paper