activity
20182021
most citedMitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography

217 citations · 390 across the 13 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph2021

Photonic Quantum Policy Learning in OpenAI Gym

Dániel Nagy, Zsolt Tabi, Péter Hága +2

In recent years, near-term noisy intermediate scale quantum (NISQ) computing devices have become available. One of the most promising application areas to leverage such NISQ quantu…

quant-ph2021★ 41 cited

Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm

Filip B. Maciejewski, Flavio Baccari, Zoltán Zimborás +1

We introduce a correlated measurement noise model that can be efficiently described and characterized, and which admits effective noise-mitigation on the level of marginal probabil…

quant-ph2020★ 49 cited

Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding

Zsolt Tabi, Kareem H. El-Safty, Zsófia Kallus +4

Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We…

quant-ph2020★ 7 cited

Space-efficient binary optimization for variational computing

Adam Glos, Aleksandra Krawiec, Zoltán Zimborás

In the era of Noisy Intermediate-Scale Quantum (NISQ) computers it is crucial to design quantum algorithms which do not require many qubits or deep circuits. Unfortunately, the mos…

quant-ph2019★ 217 cited

Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography

Filip B. Maciejewski, Zoltán Zimborás, Michał Oszmaniec

We propose a simple scheme to reduce readout errors in experiments on quantum systems with finite number of measurement outcomes. Our method relies on performing classical post-pro…

quant-ph2019★ 4 cited

Short time behavior of continuous time quantum walks on graphs

Balázs Endre Szigeti, Gábor Homa, Zoltán Zimborás +1

Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous time quantum walks (CTQWs) on graphs. In this paper, we analyze the short time asympt…

quant-ph2018★ 1 cited

Approximate recovery with locality and symmetry constraints

Cédric Bény, Zoltán Zimborás, Fernando Pastawski

Numerous quantum many-body systems are characterized by either fundamental or emergent constraints---such as gauge symmetries or parity superselection for fermions---which effectiv…