Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tanay Roy

dblp:344/1344 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-0438-012XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › quantum computer architecture
quantum compilation
0.712023
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023
Emerging computing paradigms
quantum computer architecture
0.712023
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023
Emerging computing paradigms
quantum computing
0.212023
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023
Emerging computing paradigms › quantum computing
superconducting qubit
0.212023
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023

Methods — techniques the papers use, named apart from their topics

qubit encoding · 0.7gate decomposition · 0.7
YearPublicationVenuePosition
2023 Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
abstract
Superconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices.
Andrew Litteken, Lennart Maximilian Seifert, Jason Chadwick, Natalia Nottingham, Tanay Roy, David I. Schuster, Fred Chong, Jonathan M. Baker
ISCA5