Related papers: Benchmarking Techniques for Decoded Quantum Interf…
Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. As a novel approach, quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the…
Various physical constraints limit the number of qubits that can be implemented in a single quantum processor, and thus it is necessary to connect multiple quantum processors via quantum interconnects. While several compiler implementations…
Ground State Energy Estimation (GSEE) is a central problem in quantum chemistry and condensed matter physics, demanding efficient algorithms to solve complex electronic structure calculations. This work introduces a structured benchmarking…
Rotation symmetric bosonic codes are an attractive encoding for qubits into oscillator degrees of freedom, particularly in superconducting qubit experiments. While these codes can tolerate considerable loss and dephasing, they will need to…
The noisy nature of quantum hardware necessitates the implementation of high-fidelity quantum gates in a noise-insensitive manner. While there exist many powerful methods for designing dynamically corrected gates, they typically involve an…
Linear optics is a promising alternative for the realization of quantum computation protocols due to the recent advancements in integrated photonic technology. In this context usually qubit based quantum circuits are considered, however,…
Variational quantum algorithms are gaining attention as an early application of Noisy Intermediate-Scale Quantum (NISQ) devices. One of the main problems of variational methods lies in the phenomenon of Barren Plateaus, present in the…
We propose a quantum-classical hybrid method for solving large-scale mixed-integer quadratic problems (MIQP). Although extended Benders decomposition is effective for MIQP, its master problem which handles the integer and quadratic…
The technological development of increasingly larger quantum processors on different quantum platforms raises the problem of how to fairly compare their performance, known as quantum benchmarking of quantum processors. This is a challenge…
Fault tolerance in quantum protocols requires contributions from error-correcting codes and their suitable decoders. Quantum Low-Density Parity Check (QLDPC) codes are one of the most explored quantum codes that have good coding rate and…
Quantum systems of infinite dimension, such as bosonic oscillators, provide vast resources for quantum sensing. Yet, a general theory on how to manipulate such bosonic modes for sensing beyond parameter estimation is unknown. We present a…
Noise remains the major obstacle to scalable quantum computation. Quantum benchmarking provides key information on noise properties and is an important step for developing more advanced quantum processors. However, current benchmarking…
Fault tolerant quantum computers will require efficient co-processors for real-time decoding of their adopted quantum error correction protocols. In this work we examine the possibility of using specialised Ising model hardware to perform…
We introduce AppQSim, a benchmarking suite for quantum computers focused on applications of Hamiltonian simulation. We consider five different settings for which we define a precise task and score: condensed matter and material simulation…
The Variational Quantum Eigensolver (VQE) is a promising algorithm for quantum computing applications in chemistry and materials science, particularly in addressing the limitations of classical methods for complex systems. This study…
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution…
This paper presents a highly efficient decomposition scheme and its associated Mathematica notebook for the analysis of complicated quantum circuits comprised of single/multiple qubit and qudit quantum gates. In particular, this scheme…
A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gates), we address the problem of T-count optimization, i.e.,…
Recent hardware demonstrations and advances in circuit compilation have made quantum computing with higher-dimensional systems (qudits) on near-term devices an attractive possibility. Some problems have more natural or optimal encodings…
Application-based benchmarks are increasingly used to quantify and compare quantum computers' performance. However, because contemporary quantum computers cannot run utility-scale computations, these benchmarks currently test this…