Benjamin Villalonga

Benjamin Villalonga

Auto-generated profile, based on publicly available information

Benjamin Villalonga

Google Quantum AI 90291 Venice CA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 October 2019 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
BVBenjamin Villalonga
Benjamin Villalonga
SBSergio Boixo
Sergio Boixo
BNBron Nelson
Bron Nelson
CHChristopher Henze
Christopher Henze
EREleanor Rieffel
Eleanor Rieffel
SMSalvatore Mandrà
Salvatore Mandrà
Here we present qFlex, a flexible tensor network-based quantum circuit simulator. qFlex can compute both the exact amplitudes, essential for the verification of the quantum hardware, as well as low-fidelity amplitudes, to mimic sampling from Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we focus on random quantum circuits (RQCs) in the range of sizes expected for supremacy experiments. Fidelity f simulations are performed at a cost that is 1/f lower than perfect fidelity ones. We also present a technique to eliminate the overhead introduced by rejection sampling in most tensor network approaches. We benchmark the simulation of square lattices and Google’s Bristlecone QPU. Our analysis is supported by extensive simulations on NASA HPC clusters Pleiades and Electra. For our most computationally demanding simulation, the two clusters combined reached a peak of 20 Peta Floating Point Operations per Second (PFLOPS) (single precision), i.e., 64% of their maximum achievable performance, which represents the largest numerical computation in terms of sustained FLOPs and the number of nodes utilized ever run on NASA HPC clusters. Finally, we introduce a novel multithreaded, cache-efficient tensor index permutation algorithm of general application.

7 March 2018 in Physical Review B
Verified
Journal Article
Open access
PDF file
BVBenjamin Villalonga
Benjamin Villalonga
XYXiongjie Yu
Xiongjie Yu
DLDavid J. Luitz
David J. Luitz
BCBryan K. Clark
Bryan K. Clark
Strong disorder in interacting quantum systems can give rise to the phenomenon of many-body localization (MBL), which defies thermalization due to the formation of an extensive number of quasilocal integrals of motion. The one-particle operator content of these integrals of motion is related to the one-particle orbitals (OPOs) of the one-particle density matrix and shows a strong signature across the MBL transition as recently pointed out by Bera et al. [ Phys. Rev. Lett. 115, 046603 (2015); Ann. Phys. 529, 1600356 (2017)]. We study the properties of the OPOs of many-body eigenstates of an MBL system in one dimension. Using shift-and-invert MPS, a matrix product state method to target highly excited many-body eigenstates introduced previously [ Phys. Rev. Lett. 118, 017201 (2017)], we are able to obtain accurate results for large systems of sizes up to L=64. We find that the OPOs drawn from eigenstates at different energy densities have high overlap and their occupations are correlated with the energy of the eigenstates. Moreover, the standard deviation of the inverse participation ratio of these orbitals is maximal at the nose of the mobility edge. Also, the OPOs decay exponentially in real space, with a correlation length that increases at low disorder. In addition, we find that the probability distribution of the strength of the large-range coupling constants of the number operators generated by the OPOs approach a log-uniform distribution at strong disorder.

7 May 2021 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
ECEli Chertkov
Eli Chertkov
BVBenjamin Villalonga
Benjamin Villalonga
BCBryan K. Clark
Bryan K. Clark
Disorder and interactions can lead to the breakdown of statistical mechanics in certain quantum systems, a phenomenon known as many-body localization (MBL). Much of the phenomenology of MBL emerges from the existence of ℓ bits, a set of conserved quantities that are quasilocal and binary (i.e., possess only ±1 eigenvalues). While MBL and ℓ bits are known to exist in one-dimensional systems, their existence in dimensions greater than one is a key open question. To tackle this question, we develop an algorithm that can find approximate binary ℓ bits in arbitrary dimensions by adaptively generating a basis of operators in which to represent the ℓ bit. We use the algorithm to study four models: the one-, two-, and three-dimensional disordered Heisenberg models and the two-dimensional disordered hard-core Bose-Hubbard model. For all four of the models studied, our algorithm finds high-quality ℓ bits at large disorder strength and rapid qualitative changes in the distributions of ℓ bits in particular ranges of disorder strengths, suggesting the existence of MBL transitions. These transitions in the one-dimensional Heisenberg model and two-dimensional Bose-Hubbard model coincide well with past estimates of the critical disorder strengths in these models, which further validates the evidence of MBL phenomenology in the other two- and three-dimensional models we examine. In addition to finding MBL behavior in higher dimensions, our algorithm can be used to probe MBL in various geometries and dimensionality.

16 June 2020 in Physical Review Research
Verified
Journal Article
Open access
PDF file
ECEli Chertkov
Eli Chertkov
BVBenjamin Villalonga
Benjamin Villalonga
BCBryan K. Clark
Bryan K. Clark
Symmetry is at the heart of modern physics. Phases of matter are classified by symmetry breaking, topological phases are characterized by nonlocal symmetries, and point group symmetries are critical to our understanding of crystalline materials. Symmetries could then be used as a criterion to engineer quantum systems with targeted properties. Toward that end, we have developed an approach, the symmetric Hamiltonian construction (SHC), that takes as input symmetries, specified by integrals of motion or discrete symmetry transformations, and produces as output all local Hamiltonians consistent with these symmetries. This approach builds on the slow operator method [H. Kim, M. C. Bañuls, J. I. Cirac, M. B. Hastings, and D. A. Huse, Phys. Rev. E 92, 012128 (2015)]. We use our new approach to construct new Hamiltonians for topological phases of matter. Topological phases of matter are exotic quantum phases with potential applications in quantum computation. In this work, we focus on two types of topological phases of matter: superconductors with Majorana zero modes and Z2 quantum spin liquids. In our first application of the SHC approach, we analytically construct a large and highly tunable class of superconducting Hamiltonians with Majorana zero modes with a given targeted spatial distribution. This result lays the foundation for potential new experimental routes to realizing Majorana fermions. In our second application, we find new Z2 spin-liquid Hamiltonians on the square and Kagome lattices. These new Hamiltonians are not sums of commuting operators nor frustration free and, when perturbed appropriately (in a way that preserves their Z2 spin-liquid behavior), exhibit level-spacing statistics that suggest nonintegrability. This result demonstrates how our approach can automatically generate new spin-liquid Hamiltonians with interesting properties not often seen in solvable models.

7 November 2013 in Journal of Physics B: Atomic, Molecular and Optical Physics
Verified
Journal Article
Closed access
BCBenjamín Villalonga Correa
Benjamín Villalonga Correa
AKAndreas Kurcz
Andreas Kurcz
JGJuan José García-Ripoll
Juan José García-Ripoll

7 July 2022 in arXiv
Verified
Preprint
Open access
PDF file
JBJoao Basso
Joao Basso
EFEdward Farhi
Edward Farhi
KMKunal Marwaha
Kunal Marwaha
BVBenjamin Villalonga
Benjamin Villalonga
LZLeo Zhou
Leo Zhou
The Quantum Approximate Optimization Algorithm (QAOA) finds approximate solutions to combinatorial optimization problems. Its performance monotonically improves with its depth $p$. We apply the QAOA to MaxCut on large-girth $D$-regular graphs. We give an iterative formula to evaluate performance for any $D$ at any depth $p$. Looking at random $D$-regular graphs, at optimal parameters and as $D$ goes to infinity, we find that the $p=11$ QAOA beats all classical algorithms (known to the authors) that are free of unproven conjectures. While the iterative formula for these $D$-regular graphs is derived by looking at a single tree subgraph, we prove that it also gives the ensemble-averaged performance of the QAOA on the Sherrington-Kirkpatrick (SK) model defined on the complete graph. We also generalize our formula to Max-$q$-XORSAT on large-girth regular hypergraphs. Our iteration is a compact procedure, but its computational complexity grows as $O(p^2 4^p)$. This iteration is more efficient than the previous procedure for analyzing QAOA performance on the SK model, and we are able to numerically go to $p=20$. Encouraged by our findings, we make the optimistic conjecture that the QAOA, as $p$ goes to infinity, will achieve the Parisi value. We analyze the performance of the quantum algorithm, but one needs to run it on a quantum computer to produce a string with the guaranteed performance.