149 citations · 540 across the 18 of their papers we have counts for
18 papers
Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data
Romina Yalovetzky, Martin J. A. Schuetz, Zichang He +11
Portfolio diversification - a cornerstone of modern investment management - can be formulated as a Maximum Independent Set (MIS) problem on asset correlation graphs. Solving this p…
A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
Gili Rosenberg, Kyle E. C. Booth, J. Kyle Brubaker +1
In professional sports, a team has clinched the playoffs if they are guaranteed a postseason spot, regardless of the outcomes of any remaining games. As the season progresses, spor…
Modern Computational Methods in Reinsurance Optimization: From Simulated Annealing to Quantum Branch & Bound
George Woodman, Ruben S. Andrist, Thomas Häner +4
We propose and implement modern computational methods to enhance catastrophe excess-of-loss reinsurance contracts in practice. The underlying optimization problem involves attachme…
qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
Martin J. A. Schuetz, Romina Yalovetzky, Ruben S. Andrist +8
We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem that integrates classical kernelization techniques with information extracte…
Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups
Martin J. A. Schuetz, Ruben S. Andrist, Grant Salton +7
We propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end…
Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
Atithi Acharya, Romina Yalovetzky, Pierre Minssen +10
Industrially relevant constrained optimization problems, such as portfolio optimization and portfolio rebalancing, are often intractable or difficult to solve exactly. In this work…
Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
Ruben S. Andrist, Martin J. A. Schuetz, Pierre Minssen +9
Rydberg atom arrays are among the leading contenders for the demonstration of quantum speedups. Motivated by recent experiments with up to 289 qubits [Ebadi et al., Science 376, 12…
Error tolerance of topological codes with independent bit-flip and measurement errors
Ruben S. Andrist, Helmut G. Katzgraber, H. Bombin +1
Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devi…
Erratum: Glassy Chimeras Could Be Blind to Quantum Speedup. . . [Phys. Rev. X 4, 021008 (2014)]
Martin Weigel, Helmut G. Katzgraber, Jonathan Machta +2
Erratum to Phys. Rev. X 4, 021008 (2014): The critical exponent associated with the ferromagnetic susceptibility was computed incorrectly. Furthermore, Ising ferromagnets on the Ch…
Error Thresholds for Abelian Quantum Double Models: Increasing the bit-flip Stability of Topological Quantum Memory
Ruben S. Andrist, James R. Wootton, Helmut G. Katzgraber
Current approaches for building quantum computing devices focus on two-level quantum systems which nicely mimic the concept of a classical bit, albeit enhanced with additional quan…
Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
Helmut G. Katzgraber, Firas Hamze, Ruben S. Andrist
Recently, a programmable quantum annealing machine has been built that minimizes the cost function of hard optimization problems by adiabatically quenching quantum fluctuations. Te…
Stability of topologically-protected quantum computing proposals as seen through spin glasses
Helmut G. Katzgraber, Ruben S. Andrist
Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected…
Self-Organized Criticality in Glassy Spin Systems Requires a Diverging Number of Neighbors
Juan Carlos Andresen, Zheng Zhu, Ruben S. Andrist +3
We investigate the conditions required for general spin systems with frustration and disorder to display self-organized criticality, a property which so far has been established on…
Optimal error correction in topological subsystem codes
Ruben S. Andrist, H. Bombin, Helmut G. Katzgraber +1
A promising approach to overcome decoherence in quantum computing schemes is to perform active quantum error correction using topology. Topological subsystem codes incorporate both…
Strong Resilience of Topological Codes to Depolarization
H. Bombin, Ruben S. Andrist, Masayuki Ohzeki +2
The inevitable presence of decoherence effects in systems suitable for quantum computation necessitates effective error-correction schemes to protect information from noise. We com…
Evidence of a glass transition in a 10-state non-mean-field Potts glass
Ruben S. Andrist, Derek Larson, Helmut G. Katzgraber
Potts glasses are prototype models that have been used to understand the structural glass transition. However, in finite space dimensions a glass transition remains to be detected…
Tricolored Lattice Gauge Theory with Randomness: Fault-Tolerance in Topological Color Codes
Ruben S. Andrist, Helmut G. Katzgraber, H. Bombin +1
We compute the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates, when both qubit and measurement er…
Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
Helmut G. Katzgraber, H. Bombin, Ruben S. Andrist +1
We study the error threshold of topological color codes on Union Jack lattices that allow for the full implementation of the whole Clifford group of quantum gates. After mapping th…