Archives: Paper

Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf,

Quantum 4, 230 (2020).

Brandão and Svore [14] recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithms in terms…

Christopher Eltschka and Jens Siewert,

Quantum 4, 229 (2020).

The existence of correlations between the parts of a quantum system on the one hand, and entanglement between them on the other, are different properties. Yet, one intuitively would identify…

Austin K. Daniel, Rafael N. Alexander, and Akimasa Miyake,

Quantum 4, 228 (2020).

What kinds of symmetry-protected topologically ordered (SPTO) ground states can be used for universal measurement-based quantum computation in a similar fashion to the 2D cluster state? 2D S…

Evgeny Mozgunov and Daniel Lidar,

Quantum 4, 227 (2020).

Markovian master equations are a ubiquitous tool in the study of open quantum systems, but deriving them from first principles involves a series of compromises. On the one hand, the Redfield…

Adrián Pérez-Salinas, Alba Cervera-Lierta, Elies Gil-Fuster, and José I. Latorre,

Quantum 4, 226 (2020).

A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a singl…

Tasio Gonzalez-Raya, Enrique Solano, and Mikel Sanz,

Quantum 4, 224 (2020).

The Hodgkin-Huxley model describes the conduction of the nervous impulse through the axon, whose membrane's electric response can be described employing multiple connected electric circuits…

Hakop Pashayan, Stephen D. Bartlett, and David Gross,

Quantum 4, 223 (2020).

Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits…

Yelena Guryanova, Nicolai Friis, and Marcus Huber,

Quantum 4, 222 (2020).

We show that it is impossible to perform ideal projective measurements on quantum systems using finite resources. We identify three fundamental features of ideal projective measurements and…

Shouvanik Chakrabarti, Andrew M. Childs, Tongyang Li, and Xiaodi Wu,

Quantum 4, 221 (2020).

While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We pre…

Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf,

Quantum 4, 220 (2020).

We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we…

Ravi Kunjwal,

Quantum 4, 219 (2020).

Kochen-Specker (KS) theorem reveals the inconsistency between quantum theory and any putative underlying model of it satisfying the constraint of KS-noncontextuality. A logical proof of the…

Daniel Miller, Timo Holz, Hermann Kampermann, and Dagmar Bruß,

Quantum 3, 216 (2019).

A potential quantum internet would open up the possibility of realizing numerous new applications, including provably secure communication. Since losses of photons limit long-distance, direc…

Hendrik Poulsen Nautrup, Nicolas Delfosse, Vedran Dunjko, Hans J. Briegel, and Nicolai Friis,

Quantum 3, 215 (2019).

Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laborator…