Sergio Boixo

dblp:67/10104 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-1090-7584ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 since 2021Theory of computation · 1

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
2 papers
Quantum computing and quantum information · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › large-scale simulation
massively parallel simulation
0.412020
Massively Parallel Approximate Simulation of Hard Quantum Circuits · DAC 2020
Emerging computing paradigms › quantum computer architecture
quantum circuit simulation
0.412020
Massively Parallel Approximate Simulation of Hard Quantum Circuits · DAC 2020
Emerging computing paradigms
quantum computer architecture
0.412020
Massively Parallel Approximate Simulation of Hard Quantum Circuits · DAC 2020
Quantum computing and quantum information › quantum computational models
adiabatic quantum computation
0.212013
Spectral Gap Amplification · SIAM J. Comput. 2013
Quantum computing and quantum information
quantum algorithms
0.212013
Spectral Gap Amplification · SIAM J. Comput. 2013
Quantum computing and quantum information › quantum complexity theory
hamiltonian complexity
0.012013
Spectral Gap Amplification · SIAM J. Comput. 2013

Methods — techniques the papers use, named apart from their topics

massively parallel simulation · 0.9approximate sampling · 0.9similarity transformations · 0.2black-box model · 0.2
YearPublicationVenuePosition
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.6
2020 Massively Parallel Approximate Simulation of Hard Quantum Circuits
abstract
As 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
DAC4
2013 Spectral Gap Amplification
abstract
Many problems can be solved by preparing a specific eigenstate of some Hamiltonian $H$. The generic cost of quantum algorithms for these problems is determined by the inverse spectral gap of $H$ for that eigenstate and the cost of evolving with $H$ for some fixed time. The goal of spectral gap amplification is to construct a Hamiltonian $H'$ with the same eigenstate as $H$ but a bigger spectral gap, requiring that constant-time evolutions with $H'$ and $H$ are implemented with nearly the same cost. We show that a quadratic spectral gap amplification is possible when $H$ satisfies a frustration-free property and give $H'$ for these cases. This results in quantum speedups for optimization problems. It also yields improved constructions for adiabatic simulations of quantum circuits and for the preparation of projected entangled pair states, which play an important role in quantum many-body physics. Defining a suitable black-box model, we establish that the quadratic amplification is optimal for frustration-free Hamiltonians and that no spectral gap amplification is possible, in general, if the frustration-free property is removed. A corollary is that finding a similarity transformation between a stoquastic Hamiltonian and the corresponding stochastic matrix is hard in the black-box model, setting limits to the power of some classical methods that simulate quantum adiabatic evolutions.
Rolando D. Somma, Sergio Boixo
SIAM J. Comput.2