Firas Hamze
YOU?
Author Swipe
View article: Interferometric single-shot parity measurement in InAs–Al hybrid devices
Interferometric single-shot parity measurement in InAs–Al hybrid devices Open
The fusion of non-Abelian anyons is a fundamental operation in measurement-only topological quantum computation1. In one-dimensional topological superconductors (1DTSs)2-4, fusion amounts to a determination of the shared fermion parity of …
Optimal schedules for annealing algorithms Open
Annealing algorithms such as simulated annealing and population annealing are widely used both for sampling the Gibbs distribution and solving optimization problems (i.e. finding ground states). For both statistical mechanics and optimizat…
View article: Interferometric Single-Shot Parity Measurement in an InAs-Al Hybrid Device
Interferometric Single-Shot Parity Measurement in an InAs-Al Hybrid Device Open
The fusion of non-Abelian anyons or topological defects is a fundamental operation in measurement-only topological quantum computation. In topological superconductors, this operation amounts to a determination of the shared fermion parity …
Parallelized Computation and Backpropagation Under Angle-Parametrized Orthogonal Matrices Open
We present a methodology for parallel acceleration of learning in the presence of matrix orthogonality and unitarity constraints of interest in several branches of machine learning. We show how an apparently sequential elementary rotation …
Chook -- A comprehensive suite for generating binary optimization problems with planted solutions Open
We present Chook, an open-source Python-based tool to generate discrete optimization problems of tunable complexity with a priori known solutions. Chook provides a cross-platform unified environment for solution planting using a number of …
Wishart planted ensemble: A tunably rugged pairwise Ising model with a first-order phase transition Open
We propose the Wishart planted ensemble, a class of zero-field Ising models with tunable algorithmic hardness and specifiable (or planted) ground state. The problem class arises from a simple procedure for generating a family of random int…
Computational hardness of spin-glass problems with tile-planted solutions Open
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into edge-…
From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems Open
We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass mode…
Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities Open
Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here, we present results from classical parallel-tempering Monte Carlo simulations combined …