The Short Path Algorithm Applied to a Toy Model

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 $\textit{simulability}$ of channels by means of dynamical maps.…

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…

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…

Aleks Kissinger and John van de Wetering,

Quantum 3, 134 (2019).

We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are…

Markus Heinrich and David Gross,

Quantum 3, 132 (2019).

We give a new algorithm for computing the $\textit{robustness of magic}$ – a measure of the utility of quantum states as a computational resource. Our work is motivated by the $\textit{magic state model}$…

Naomi H. Nickerson and Benjamin J. Brown,

Quantum 3, 131 (2019).

Laboratory hardware is rapidly progressing towards a state where quantum error-correcting codes can be realised. As such, we must learn how to deal with the complex nature of the noise that…