Demo Data from EDBT 2026 / reviewers in the wild / expert
Sergei Isakov
dblp:147/4820 · also Sergei V. Isakov
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Emerging computing paradigms · 67% High-performance computing · 33% | |
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing › large-scale simulation
massively parallel simulation |
0.4 | 1 | 2020 | Massively Parallel Approximate Simulation of Hard Quantum Circuits · DAC 2020 |
Emerging computing paradigms › quantum computer architecture
quantum circuit simulation |
0.4 | 1 | 2020 | Massively Parallel Approximate Simulation of Hard Quantum Circuits · DAC 2020 |
Emerging computing paradigms
quantum computer architecture |
0.4 | 1 | 2020 | Massively Parallel Approximate Simulation of Hard Quantum Circuits · DAC 2020 |
Methods — techniques the papers use, named apart from their topics
massively parallel simulation · 0.9approximate sampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
Kostyantyn Kechedzhi, Sergei Isakov, Salvatore Mandrà, Benjamin Villalonga, X. Mi, Sergio Boixo, Vadim Smelyanskiy |
Future Gener. Comput. Syst. | 2 |
| 2020 | Massively Parallel Approximate Simulation of Hard Quantum CircuitsabstractAs quantum computers grow more capable, simulating them on conventional hardware becomes more challenging yet more attractive since this helps in design and verification. Some quantum algorithms and circuits are amenable to surprisingly efficient simulation, and this makes hard-to-simulate computations particularly valuable. For such circuits, we develop accurate massively-parallel simulation with dramatic speedups over earlier methods on 42- and 45-qubit circuits. We propose two ways to trade circuit fidelity for computational speedups, so as to match the error rate of any quantum computer. Using Google Cloud, we simulate approximate sampling from the output of a circuit with 7 × 8 qubits and depth 42 with fidelity 0.5% at an estimated cost of $35K. Igor L. Markov, Aneeqa Fatima, Sergei Isakov, Sergio Boixo |
DAC | 3 |