Archives: Paper

A. Vukics, A. Dombi, J. M. Fink, and P. Domokos,

Quantum 3, 150 (2019).

We prove that the observable telegraph signal accompanying the bistability in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings model is the finite-size precursor…

Valentin Torggler, Philipp Aumann, Helmut Ritsch, and Wolfgang Lechner,

Quantum 3, 149 (2019).

The $N$-queens problem is to find the position of $N$ queens on an $N$ by $N$ chess board such that no queens attack each other. The excluded diagonals $N$-queens problem is a variation wher…

Spencer Breiner, Carl A. Miller, and Neil J. Ross,

Quantum 3, 146 (2019).

We introduce a framework for graphical security proofs in device-independent quantum cryptography using the methods of categorical quantum mechanics. We are optimistic that this approach wil…

David Davalos, Mario Ziman, and Carlos Pineda,

Quantum 3, 144 (2019).

The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the simulability of channels by means of dynamical maps. In particul…

Christopher Chamberland and Andrew W. Cross,

Quantum 3, 143 (2019).

Magic state distillation is one of the leading candidates for implementing universal fault-tolerant logical gates. However, the distillation circuits themselves are not fault-tolerant, so th…

David T. Stephen, Hendrik Poulsen Nautrup, Juani Bermejo-Vega, Jens Eisert, and Robert Raussendorf,

Quantum 3, 142 (2019).

Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics b…

Ben Haylock, Daniel Peace, Francesco Lenzini, Christian Weedbrook, and Mirko Lobino,

Quantum 3, 141 (2019).

Fast secure random number generation is essential for high-speed encrypted communication, and is the backbone of information security. Generation of truly random numbers depends on the intri…

Sumeet Khatri, Ryan LaRose, Alexander Poremba, Lukasz Cincio, Andrew T. Sornborger, and Patrick J. Coles,

Quantum 3, 140 (2019).

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by indu…

Joel Klassen and Barbara M. Terhal,

Quantum 3, 139 (2019).

We examine the problem of determining if a 2-local Hamiltonian is stoquastic by local basis changes. We analyze this problem for two-qubit Hamiltonians, presenting some basic tools and givin…

Frédéric Bouchard, Felix Hufnagel, Dominik Koutný, Aazad Abbas, Alicia Sit, Khabat Heshami, Robert Fickler, and Ebrahim Karimi,

Quantum 3, 138 (2019).

The characterization of quantum processes, e.g. communication channels, is an essential ingredient for establishing quantum information systems. For quantum key distribution protocols, the a…

Vieri Benci, Lorenzo Luperi Baglini, and Kyrylo Simonov,

Quantum 3, 137 (2019).

Non-Archimedean mathematics is an approach based on fields which contain infinitesimal and infinite elements. Within this approach, we construct a space of a particular class of generalized…

Pedro Figueroa-Romero, Kavan Modi, and Felix A. Pollock,

Quantum 3, 136 (2019).

It is common, when dealing with quantum processes involving a subsystem of a much larger composite closed system, to treat them as effectively memory-less (Markovian). While open systems the…

Craig Gidney and Austin G. Fowler,

Quantum 3, 135 (2019).

We present magic state factory constructions for producing $|CCZ\rangle$ states and $|T\rangle$ states. For the $|CCZ\rangle$ factory we apply the surface code lattice surgery construction t…