default search action
Andrew Litteken
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]Andrew Litteken, Lennart Maximilian Seifert, Jason Chadwick
, Natalia Nottingham, Frederic T. Chong, Jonathan M. Baker:
Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction. ASPLOS (2) 2023: 646-659 - [c7]Andrew Litteken
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures. ISCA 2023: 71:1-71:14 - [c6]Colin Campbell, Frederic T. Chong, Denny Dahl, Paige Frederick, Palash Goiporia, Pranav Gokhale, Benjamin P. Hall, Salahedeen Issa, Eric Jones, Stephanie Lee, Andrew Litteken, Victory Omole, David Owusu-Antwi, Michael A. Perlin
Superstaq: Deep Optimization of Quantum Programs. QCE 2023: 1020-1032 - [i6]Andrew Litteken, Lennart Maximilian Seifert, Jason Chadwick, Natalia Nottingham, Frederic T. Chong, Jonathan M. Baker:
Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction. CoRR abs/2303.00658 (2023) - [i5]Andrew Litteken, Lennart Maximilian Seifert, Jason D. Chadwick, Natalia Nottingham, Tanay Roy, Ziqian Li, David I. Schuster, Frederic T. Chong, Jonathan M. Baker:
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures. CoRR abs/2303.14069 (2023) - 2022
- [c5]Andrew Litteken, Jonathan M. Baker, Frederic T. Chong:
Communication Trade Offs in Intermediate Qudit Circuits. ISMVL 2022: 43-49 - [c4]Lennart Maximilian Seifert, Jason Chadwick
Time-Efficient Qudit Gates through Incremental Pulse Re-seeding. QCE 2022: 304-313 - [c3]Andrew Litteken, Jonathan M. Baker, Frederic T. Chong:
Reducing Runtime Overhead via Use-Based Migration in Neutral Atom Quantum Architectures. QCE 2022: 566-576 - [i4]Andrew Litteken, Jonathan M. Baker, Frederic T. Chong:
Reducing Runtime Overhead via Use-Based Migration in Neutral Atom Quantum Architectures. CoRR abs/2211.15757 (2022) - [i3]Andrew Litteken, Jonathan M. Baker, Frederic T. Chong:
Communication Trade Offs in Intermediate Qudit Circuits. CoRR abs/2211.16469 (2022) - 2021
- [c2]Casey Duckering
Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates. ASPLOS 2021: 375-385 - [c1]Jonathan M. Baker, Andrew Litteken, Casey Duckering, Henry Hoffmann, Hannes Bernien
Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures. ISCA 2021: 818-831 - [i2]Casey Duckering, Jonathan M. Baker, Andrew Litteken, Frederic T. Chong:
Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates. CoRR abs/2102.08451 (2021) - [i1]Jonathan M. Baker, Andrew Litteken, Casey Duckering, Henry Hoffmann, Hannes Bernien, Frederic T. Chong:
Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures. CoRR abs/2111.06469 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: