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.

Ian Teixeira

dblp:394/5662 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0006-1558-2324ORCID · corroborated

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

Security and privacy · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
1 paper
Quantum computing and quantum information · 91% Coding theory · 9%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum error correction
quantum code
0.912025
Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum error correction
0.912025
Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum error correction › fault-tolerant quantum computation
transversal gates
0.912025
Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates · IEEE Trans. Inf. Theory 2025
Coding theory › distributed storage › distributed storage codes
permutation-invariant codes
0.312025
Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates · IEEE Trans. Inf. Theory 2025

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

stabilizer codes · 0.9spin codes · 0.9
YearPublicationVenuePosition
2025 Quantum codes and irreducible products of characters
abstract
Abstract In a recent paper, we defined a type of weighted unitary design called a twisted unitary 1-group and showed that such a design automatically induced error-detecting quantum codes. We also showed that twisted unitary 1-groups correspond to irreducible products of characters thereby reducing the problem of code-finding to a computation in the character theory of finite groups. Using a combination of GAP computations and results from the mathematics literature on irreducible products of characters, we identify many new non-trivial quantum codes with unusual transversal gates. Transversal gates are of significant interest to the quantum information community for their central role in fault tolerant quantum computing. Most unitary $$\text {t}$$ t -designs have never been realized as the transversal gate group of a quantum code. We, for the first time, find nontrivial quantum codes realizing nearly every finite group which is a unitary 2-design or better as the transversal gate group of some error-detecting quantum code.
Eric Kubischta, Ian Teixeira
Des. Codes Cryptogr.2
2025 Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates
abstract
With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit codes that can implement generalized phase gates transversally. Of particular note, we construct permutation-invariant quantum codes that implement a transversal T gate using fewer qubits and with a better minimum distance than is possible with the best known stabilizer codes.
Eric Kubischta, Ian Teixeira
IEEE Trans. Inf. Theory2