Papers

S. Kiesewetter, P. Drummond·May 10, 2021

A new, to the best of our knowledge, technique is demonstrated for carrying out exact positive-P phase-space simulations of the coherent Ising machine quantum computer. By suitable design of the coupling matrix, general hard optimization problems can...

Shigeo Hakkaku, K. Mitarai, K. Fujii·May 10, 2021

Shigeo Hakkaku, ∗ Kosuke Mitarai, 2, 3, † and Keisuke Fujii 2, 4, 5, ‡ Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan Center for Quantum Information and Quantum Biology, Osaka University, ...

A. Benavoli, Alessandro Facchini, Marco Zaffalon·May 10, 2021

Two particles are identical if all their intrinsic properties, such as spin and charge, are the same, meaning that no quantum experiment can distinguish them. In addition to the well known principles of quantum mechanics, understanding systems of ide...

K. Seshadreesan, Prajit Dhara, A. Patil +2 more·May 10, 2021

Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-en...

Jonathan Gorard, Manojna Namuduri, X. Arsiwalla·May 10, 2021

We introduce an intuitive algorithmic methodology for enacting automated rewriting of string diagrams within a general double-pushout (DPO) framework, in which the sequence of rewrites is chosen in accordance with the causal structure of the underlyi...

Jakob S. Kottmann, A. Aspuru‐Guzik·May 9, 2021

We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, ...

B. Poirier, J. Jerke·May 8, 2021

Traditional methods in quantum chemistry rely on Hartree-Fock-based Slater-determinant (SD) representations, whose underlying zeroth-order picture assumes separability by particle. Here, we explore a radically different approach, based on separabilit...

Leonard Wossnig·May 8, 2021

In this dissertation, we study the intersection of quantum computing and supervised machine learning algorithms, which means that we investigate quantum algorithms for supervised machine learning that operate on classical data. This area of research ...

Jennifer R. Glick, Tanvi P. Gujarati, A. Córcoles +4 more·May 7, 2021

The use of kernel functions is a common technique to extract important features from datasets. A quantum computer can be used to estimate kernel entries as transition amplitudes of unitary circuits. Quantum kernels exist that, subject to computationa...

Thomas Hahn, E. Y. Tan·May 7, 2021

It is known that advantage distillation (that is, information reconciliation using two-way communication) improves noise tolerances for quantum key distribution (QKD) setups. Two-way communication is hence also of interest in the device-independent c...

Scott Johnstun, J. F. Huele·May 7, 2021

The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles under a Hei...

K. Sankar, A. Scherer, S. Kako +8 more·May 7, 2021

We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the Dürr–Høyer algorithm for quantum minimum findi...

Franccois Le Gall, H. Nishimura, A. Yakaryılmaz·May 6, 2021

Post-selection, the power of discarding all runs of a computation in which an undesirable event occurs, is an influential concept introduced to the field of quantum complexity theory by Aaronson (Proceedings of the Royal Society A, 2005). In the pres...

J. Martyn, Z. M. Rossi, Andrew K. Tan +1 more·May 6, 2021

Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, wh...

R. K. Colmenar, U. Güngördü, J. Kestner·May 6, 2021

Geometric quantum gates are often expected to be more resilient than dynamical gates against certain types of error, which would make them ideal for robust quantum computing. However, this is still up for debate due to seemingly conflicting results in...

Marcel Seelbach Benkner, Zorah Lähner, Vladislav Golyanik +3 more·May 6, 2021

Finding shape correspondences can be formulated as an ${\mathcal{N}}{\mathcal{P}} - hard$ quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic opt...

S. Flammia, R. O'Donnell·May 6, 2021

Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the "Population Recovery" problem, we give an extrem...

Y. Ozhigov·May 6, 2021

The complexity of the quantum state of a multiparticle system and the maximum possible accuracy of its quantum description are connected by a relation similar to the coordinate-momentum uncertainty relation. The coefficient in this relation is equal ...

R. B. Christensen, C. Munuera, F. Pereira +1 more·May 5, 2021

<p style='text-indent:20px;'>We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown pa...

A. O. Quintavalle, E. Campbell·May 5, 2021

The design of decoding algorithms is a significant technological component in the development of fault-tolerant quantum computers. Often design of quantum decoders is inspired by classical decoding algorithms, but there are no general principles for ...