activity
20072026
most citedSupplementary information for "Quantum supremacy using a programmable superconducting processor"

7.2k citations · 9.8k across the 44 of their papers we have counts for

collaborators
Showing cond-mat.dis-nnShow all

5 papers · 1 filter

cond-mat.dis-nn2020★ 1 cited

Optimization and benchmarking of the thermal cycling algorithm

Amin Barzegar, Anuj Kankani, Salvatore Mandrà +1

Optimization plays a significant role in many areas of science and technology. Most of the industrial optimization problems have inordinately complex structures that render finding…

cond-mat.dis-nn2018★ 9 cited

Feeding the multitude: A polynomial-time algorithm to improve sampling

Andrew J. Ochoa, Darryl C. Jacob, Salvatore Mandrà +1

A wide variety of optimization techniques, both exact and heuristic, tend to be biased samplers. This means that when attempting to find multiple uncorrelated solutions of a degene…

cond-mat.dis-nn2017★ 13 cited

Patch-planting spin-glass solution for benchmarking

Wenlong Wang, Salvatore Mandrà, Helmut G. Katzgraber

We introduce an algorithm to generate (not solve) spin-glass instances with planted solutions of arbitrary size and structure. First, a set of small problem patches with open bound…

cond-mat.dis-nn2014★ 213 cited

Quantum Optimization of Fully-Connected Spin Glasses

Davide Venturelli, Salvatore Mandrà, Sergey Knysh +3

The Sherrington-Kirkpatrick model with random couplings is programmed on the D-Wave Two annealer featuring 509 qubits interacting on a Chimera-type graph. The performance of…

cond-mat.dis-nn2010

Typical rank of coin-toss power-law random matrices over GF(2)

Salvatore Mandrà, Marco Cosentino Lagomarsino, Bruno Bassetti

Random linear systems over the Galois Field modulo 2 have an interest in connection with problems ranging from computational optimization to complex networks. They are often approa…