scispace - formally typeset
R

Rupak Biswas

Researcher at Ames Research Center

Publications -  173
Citations -  13419

Rupak Biswas is an academic researcher from Ames Research Center. The author has contributed to research in topics: Load balancing (computing) & Grid. The author has an hindex of 41, co-authored 173 publications receiving 9962 citations. Previous affiliations of Rupak Biswas include Computer Sciences Corporation & Research Institute for Advanced Computer Science.

Papers
More filters
Journal ArticleDOI

Supplementary information for "Quantum supremacy using a programmable superconducting processor"

TL;DR: In this paper, an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature, is presented.
Journal ArticleDOI

Quantum supremacy using a programmable superconducting processor

Frank Arute, +85 more
- 24 Oct 2019 - 
TL;DR: Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
Journal ArticleDOI

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz.

TL;DR: The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.
Journal ArticleDOI

Parallel, adaptive finite element methods for conservation laws

TL;DR: This work constructs parallel finite element methods for the solution of hyperbolic conservation laws in one and two dimensions and presents results using adaptive h- and p-refinement to reduce the computational cost of the method.
Journal ArticleDOI

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

TL;DR: The quantum alternating operator ansatz (QOANSatz) as discussed by the authors is a generalization of the original quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian.