Quantum

Paper

Entanglement characterization using quantum designs

Andreas Ketterer, Nikolai Wyderka, and Otfried Gühne,

Quantum 4, 325 (2020).

We present in detail a statistical approach for the reference-frame-independent detection and characterization of multipartite entanglement based on moments of randomly measured correlation…

Paper

Accelerated variational algorithms for digital quantum simulation of many-body ground states

Chufan Lyu, Victor Montenegro, and Abolfazl Bayat,

Quantum 4, 324 (2020).

One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physic…

Paper

Expansion Testing using Quantum Fast-Forwarding and Seed Sets

Simon Apers,

Quantum 4, 323 (2020).

Expansion testing aims to decide whether an $n$-node graph has expansion at least $\Phi$, or is far from any such graph. We propose a quantum expansion tester with complexity…

Paper

Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters

Ewout van den Berg and Kristan Temme,

Quantum 4, 322 (2020).

Many applications of practical interest rely on time evolution of Hamiltonians that are given by a sum of Pauli operators. Quantum circuits for exact time evolution of single Pauli operators…

Paper

Detecting crosstalk errors in quantum information processors

Mohan Sarovar, Timothy Proctor, Kenneth Rudinger, Kevin Young, Erik Nielsen, and Robin Blume-Kohout,

Quantum 4, 321 (2020).

Crosstalk occurs in most quantum computing systems with more than one qubit. It can cause a variety of correlated and nonlocal $\textit{crosstalk errors}$ that can be especially harmful to fau…

Paper

Worst-case Quantum Hypothesis Testing with Separable Measurements

Le Phuc Thinh, Michele Dall’Arno, and Valerio Scarani,

Quantum 4, 320 (2020).

For any pair of quantum states (the hypotheses), the task of binary quantum hypotheses testing is to derive the tradeoff relation between the probability $p_{01}$ of rejecting the null hypothe…

Paper

Compositional resource theories of coherence

John H. Selby and Ciarán M. Lee,

Quantum 4, 319 (2020).

Quantum coherence is one of the most important resources in quantum information theory. Indeed, preventing the loss of coherence is one of the most important technical challenges obstructing…

Paper

Efficient classical simulation of noisy random quantum circuits in one dimension

Kyungjoo Noh, Liang Jiang, and Bill Fefferman,

Quantum 4, 318 (2020).

Understanding the computational power of noisy intermediate-scale quantum (NISQ) devices is of both fundamental and practical importance to quantum information science. Here, we address the…

Paper

Wigner function for SU(1,1)

U. Seyfarth, A. B. Klimov, H. de Guise, G. Leuchs, and L. L. Sanchez-Soto,

Quantum 4, 317 (2020).

In spite of their potential usefulness, Wigner functions for systems with SU(1,1) symmetry have not been explored thus far. We address this problem from a physically-motivated perspective, w…

Paper

Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?

Armin Tavakoli, Marek Żukowski, and Časlav Brukner,

Quantum 4, 316 (2020).

Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement…

Paper

Automatic design of Hamiltonians

Kiryl Pakrouski,

Quantum 4, 315 (2020).

We formulate an optimization problem of Hamiltonian design based on the variational principle. Given a variational ansatz for a Hamiltonian we construct a loss function to be minimised as a…

Paper

Stochastic gradient descent for hybrid quantum-classical optimization

Ryan Sweke, Frederik Wilde, Johannes Meyer, Maria Schuld, Paul K. Faehrmann, Barthélémy Meynard-Piganeau, and Jens Eisert,

Quantum 4, 314 (2020).

Within the context of hybrid quantum-classical optimization, gradient descent based optimizers typically require the evaluation of expectation values with respect to the outcome of parameter…

Paper

Weak approximate unitary designs and applications to quantum encryption

Cécilia Lancien and Christian Majenz,

Quantum 4, 313 (2020).

Unitary $t$-designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of such unitary $t$-…

Paper

On Basing One-way Permutations on NP-hard Problems under Quantum Reductions

Nai-Hui Chia, Sean Hallgren, and Fang Song,

Quantum 4, 312 (2020).

A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case…

Paper

Braiding quantum gates from partition algebras

Pramod Padmanabhan, Fumihiko Sugino, and Diego Trancanelli,

Quantum 4, 311 (2020).

Unitary braiding operators can be used as robust entangling quantum gates. We introduce a solution-generating technique to solve the $(d,m,l)$-generalized Yang-Baxter equation, for…

Paper

Neural Network Decoders for Large-Distance 2D Toric Codes

Xiaotong Ni,

Quantum 4, 310 (2020).

We still do not have perfect decoders for topological codes that can satisfy all needs of different experimental setups. Recently, a few neural network based decoders have been studied, with…

Category: Paper