Papers

Jonas M. Kübler, Simon Buchholz, B. Scholkopf·Jun 7, 2021

It has been hypothesized that quantum computers may lend themselves well to applications in machine learning. In the present work, we analyze function classes defined via quantum kernels. Quantum computers offer the possibility to efficiently compute...

M. Ma̧dzik, Serwan Asaad, Akram Youssry +17 more·Jun 6, 2021

Nuclear spins were among the first physical platforms to be considered for quantum information processing1,2, because of their exceptional quantum coherence3 and atomic-scale footprint. However, their full potential for quantum computing has not yet ...

Fernando Miranda, P. Balbi, Pedro C. S. Costa·Jun 6, 2021

While advances in quantum hardware occur in modest steps, simulators running on classical computers provide a valuable test bed for the construction of quantum algorithms. Given a unitary matrix that performs certain operation, obtaining the equivale...

M. T. Veszeli, G. Vattay·Jun 6, 2021

The Quadratic Unconstrained Binary Optimization (QUBO) problem is NP-hard. Some exact methods like the Branch-and-Bound algorithm are suitable for small problems. Some approximations like stochastic simulated annealing for discrete variables or mean-...

Aleksander Kubica, M. Vasmer·Jun 4, 2021

Fault-tolerant protocols and quantum error correction (QEC) are essential to building reliable quantum computers from imperfect components that are vulnerable to errors. Optimizing the resource and time overheads needed to implement QEC is one of the...

Yong-Hua Yang, Peiya Li, Shi-Zhao Ma +10 more·Jun 4, 2021

Quantum key distribution (QKD) provides information theoretically secure key exchange requiring authentication of the classic data processing channel via pre-sharing of symmetric private keys to kick-start the process. In previous studies, the lattic...

Amara Katabarwa, Sukin Sim, Dax Enshan Koh +1 more·Jun 4, 2021

Parameterized quantum circuits (PQCs) are a central component of many variational quantum algorithms, yet there is a lack of understanding of how their parameterization impacts algorithm performance. We initiate this discussion by using principal bun...

Mathieu Roget, G. Molfetta, H. Kadri·Jun 4, 2021

Quantum machine learning algorithms could provide significant speed-ups over their classical coun-terparts; however, whether they could also achieve good generalization remains unclear. Recently, two quantum perceptron models which give a quadratic im...

Clemens Dlaska, K. Ender, G. Mbeng +3 more·Jun 4, 2021

A large ongoing research effort focuses on obtaining a quantum advantage in the solution of combinatorial optimization problems on near-term quantum devices. A particularly promising platform implementing quantum optimization algorithms are arrays of...

Theerapat Tansuwannont, D. Leung·Jun 4, 2021

Attaining fault tolerance while maintaining low overhead is one of the main challenges in a practical implementation of quantum circuits. One major technique that can overcome this problem is the flag technique, in which high-weight errors arising fro...

A. Tomonaga, H. Mukai, F. Yoshihara +1 more·Jun 3, 2021

A. Tomonaga, 2, ∗ H. Mukai, 2 F. Yoshihara, and J. S. Tsai 2, † Department of Physics, Tokyo University of Science, 1–3 Kagurazaka, Shinjuku, Tokyo 162–0825, Japan RIKEN Center for Quantum Computing (RQC), 2–1 Hirosawa, Wako, Saitama 351–0198, Japan ...

Xin Hong, Yuan Feng, Sanjiang Li +1 more·Jun 3, 2021

Despite the rapid development of quantum computing these years, state-of-the-art quantum devices still contain only a limited number of qubits. One possible way to execute more realistic algorithms in near-term quantum devices is to employ dynamic qu...

N. Costa, Omar Yasser, A. Sultanov +1 more·Jun 3, 2021

Quantum phase estimation is a paradigmatic problem in quantum sensing and metrology. Here we show that adaptive methods based on classical machine learning algorithms can be used to enhance the precision of quantum phase estimation when noisy non-ent...

H. Buhrman, B. Loff, Subhasree Patro +1 more·Jun 3, 2021

Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: ...

A. S. Popova, A. N. Rubtsov·Jun 2, 2021

Here we challenge the quantum advantage claimed for the Gaussian Boson Sampling experiment by introducing an approximate polynomial-time algorithm. Our fourth-order approximation gives an accuracy comparable with that of the experiment.

T. Hubregtsen, Frederik Wilde, Shozab Qasim +1 more·Jun 2, 2021

Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum–classical setup. Examples are variational quantum eigensolvers, quantum approximate...

Eliot Rosenberg, P. Ginsparg, P. McMahon·Jun 2, 2021

Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods h...

Yuan Feng, M. McGuigan·Jun 2, 2021

We study different aspects the worldline path integrals with gauge fields using quantum computing. We use the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) quantum algorithms and IBM QISKit to perform our computations. We a...

Y. Bando, H. Nishimori·Jun 2, 2021

Simulated quantum annealing based on the path-integral Monte Carlo is one of the most common tools to simulate quantum annealing on classical hardware. Nevertheless, it is in principle highly non-trivial whether or not this classical algorithm can co...

Marcos Allende, D. Le'on, Sergio Cer'on +10 more·Jun 1, 2021

The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor’s algorithm on a large scale, the most used asymm...