Rupak Biswas

Dr. Rupak Biswas


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
12 February 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
SHStuart Hadfield
Stuart Hadfield
ZWZhihui Wang
Zhihui Wang
BOBryan O’gorman
Bryan O’gorman
EREleanor Rieffel
Eleanor Rieffel
DVDavide Venturelli
Davide Venturelli
RBRupak Biswas
Rupak Biswas
The next few years will be exciting as prototype universal quantum processors emerge, enabling the implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation and which have the potential to significantly expand the breadth of applications for which quantum computers have an established advantage. A leading candidate is Farhi et al.’s quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between more general families of operators. 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. This ansatz supports the representation of a larger, and potentially more useful, set of states than the original formulation, with potential long-term impact on a broad array of application areas. For cases that call for mixing only within a desired subspace, refocusing on unitaries rather than Hamiltonians enables more efficiently implementable mixers than was possible in the original framework. Such mixers are particularly useful for optimization problems with hard constraints that must always be satisfied, defining a feasible subspace, and soft constraints whose violation we wish to minimize. More efficient implementation enables earlier experimental exploration of an alternating operator approach, in the spirit of the quantum approximate optimization algorithm, to a wide variety of approximate optimization, exact optimization, and sampling problems. In addition to introducing the quantum alternating operator ansatz, we lay out design criteria for mixing operators, detail mappings for eight problems, and provide a compendium with brief descriptions of mappings for a diverse array of problems.

28 February 2005 in Applied Numerical Mathematics
Verified
Journal Article
Closed access
HFHuiyu Feng
Huiyu Feng
RWRob Van der Wijngaart
Rob Van der Wijngaart
RBRupak Biswas
Rupak Biswas

10 May 2009
Verified
Book Chapter
Closed access
PDF file
RBRupak Biswas
Rupak Biswas
ETEugene L. Tu
Eugene L. Tu
RDR. William Van Dalsem
R. William Van Dalsem

7 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
BVBenjamin Villalonga
Benjamin Villalonga
DLDmitry Lyakh
Dmitry Lyakh
SBSergio Boixo
Sergio Boixo
HNHartmut Neven
Hartmut Neven
THTravis Humble
Travis Humble
SMSalvatore Mandrà
Salvatore Mandrà
Noisy Intermediate-Scale Quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving "Quantum Supremacy", a major milestone in quantum computing. NISQ Supremacy requires comparison with a state-of-the-art classical simulator. We report HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of Quantum Supremacy, sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the World. These simulations were carried out using qFlex, a tensor-network-based classical high-performance simulator of RQCs. Our results show an advantage of many orders of magnitude in energy consumption of NISQ devices over classical supercomputers. In addition, we propose a standard benchmark for NISQ computers based on qFlex.

18 August 2011 in Parallel Computing
Verified
Journal Article
Closed access
LOLeonid Oliker
Leonid Oliker
RNRajesh Nishtala
Rajesh Nishtala
RBRupak Biswas
Rupak Biswas