Search NASA⌕ Search
Home/Archive/NASA NTRS

NASA NTRS · 20240011633

Tools for Quantum Algorithms, Protocols, Benchmarking, Architectural Design and Co-Design

Eleanor Rieffel·M Sohaib Alam·Nishchay Suri·Jason Saied·Davide Venturelli·Nicholas Bornman·Tanay Roy·Joshua Job·Namit Anand·Gabriel Perdue·Silvia Zorzetti·Ahmed A Akhtar·Jeffrey Marshall·Yi-Zhuang You·Andrew Hardy·Priyanka Mukhopadhyay·Robert Konik·Layla Hormozi·Stuart Hadfield·João Barata·Raju Venugopalan·Dmitri Kharzeev·Nathan Wiebe·Shantom Borah·Asit Pradhan·Nithin Raveendran·Narayanan Rengaswamy·Bane Vasić
View original source ↗Export metadata ↓

Abstract

The source did not provide an abstract. Follow the original record for more information.

Explore related subjects

Quantum computingQuantum error correctionQuantum BenchmarkingHigh Energy Physics

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eleanor Rieffel, M Sohaib Alam, Nishchay Suri, Jason Saied, Davide Venturelli, Nicholas Bornman, Tanay Roy, Joshua Job, Namit Anand, Gabriel Perdue, Silvia Zorzetti, Ahmed A Akhtar, Jeffrey Marshall, Yi-Zhuang You, Andrew Hardy, Priyanka Mukhopadhyay, Robert Konik, Layla Hormozi, Stuart Hadfield, João Barata, Raju Venugopalan, Dmitri Kharzeev, Nathan Wiebe, Shantom Borah, Asit Pradhan, Nithin Raveendran, Narayanan Rengaswamy, Bane Vasić. Tools for Quantum Algorithms, Protocols, Benchmarking, Architectural Design and Co-Design. https://ntrs.nasa.gov/citations/20240011633

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

NASA NTRS2022

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗
NASA NTRSDate not supplied

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire.

Quantum computing↗