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

Jonathan Grattage

dblp:21/6520 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2012
0000-0001-5774-9483ORCID · corroborated

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

Theory of computation · 3Artificial intelligence and machine learning · 1

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.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language semantics › formal semantics › denotational semantics
categorical semantics
0.112005
A Functional Quantum Programming Language · LICS 2005
Programming languages and type systems › type theory
linear logic
0.112005
A Functional Quantum Programming Language · LICS 2005
Programming languages and type systems › programming paradigms
reversible computation
0.112005
A Functional Quantum Programming Language · LICS 2005
Quantum computing and quantum information
quantum programming languages
0.112005
A Functional Quantum Programming Language · LICS 2005

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

quantum gates · 0.1categorical semantics · 0.1
YearPublicationVenuePosition
2012 Intrinsically universal n-dimensional quantum cellular automata
Pablo Arrighi, Jonathan Grattage
J. Comput. Syst. Sci.2
2012 Partitioned quantum cellular automata are intrinsically universal
Pablo Arrighi, Jonathan Grattage
Nat. Comput.2
2010 A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
Pablo Arrighi, Jonathan Grattage
LATA2
2005 A Functional Quantum Programming Language
abstract
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive semantics of irreversible quantum computations realisable as quantum gates. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings explicit. Strict programs are free from decoherence and hence preserve superpositions and entanglement - which is essential for quantum parallelism.
Thorsten Altenkirch, Jonathan Grattage
LICS2