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

Shane Mansfield

dblp:98/10547 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-2231-2422ORCID · corroborated

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

Theory of computation · 4 · 2 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
2 papers
Logic in computer science · 67% Quantum computing and quantum information · 33%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
completeness
0.712023
A Complete Equational Theory for Quantum Circuits · LICS 2023
Logic in computer science › algebraic logic › equational logic
equational theory
0.712023
A Complete Equational Theory for Quantum Circuits · LICS 2023
Quantum computing and quantum information
quantum circuit
0.712023
A Complete Equational Theory for Quantum Circuits · LICS 2023
Logic in computer science
categorical semantics
0.412019
A comonadic view of simulation and quantum resources · LICS 2019
Logic in computer science › category theory
comonad
0.412019
A comonadic view of simulation and quantum resources · LICS 2019
Quantum computing and quantum information › quantum foundations
contextuality
0.412019
A comonadic view of simulation and quantum resources · LICS 2019

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

sheaf-theoretic approach · 0.4co-kleisli category · 0.4
YearPublicationVenuePosition
2023 A Complete Equational Theory for Quantum Circuits
abstract
We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations. The proof is based on the properties of multi-controlled gates – that are defined using elementary gates – together with an encoding of quantum circuits into linear optical circuits, which have been proved to have a complete axiomatisation.
Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron
LICS3
2022 LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits
abstract
We introduce the LO_v-calculus, a graphical language for reasoning about linear optical quantum circuits with so-called vacuum state auxiliary inputs. We present the axiomatics of the language and prove its soundness and completeness: two LO_v-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LO_v-calculus. We give a confluent and terminating rewrite system to rewrite any polarisation-preserving LO_v-circuit into a unique triangular normal form, inspired by the universal decomposition of Reck et al. (1994) for linear optical quantum circuits.
Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron
MFCS3
2019 A comonadic view of simulation and quantum resources
abstract
We study simulation and quantum resources in the setting of the sheaf-theoretic approach to contextuality and nonlocality. Resources are viewed behaviourally, as empirical models. In earlier work, a notion of morphism for these empirical models was proposed and studied. We generalize and simplify the earlier approach, by starting with a very simple notion of morphism, and then extending it to a more useful one by passing to a co-Kleisli category with respect to a comonad of measurement protocols. We show that these morphisms capture notions of simulation between empirical models obtained via “free” operations in a resource theory of contextuality, including the type of classical control used in measurement-based quantum computation schemes.
Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield
LICS4
2015 Contextuality, Cohomology and Paradox
abstract
Contextuality is a key feature of quantum mechanics that provides an important non-classical resource for quantum information and computation. Abramsky and Brandenburger used sheaf theory to give a general treatment of contextuality in quantum theory [New Journal of Physics 13 (2011) 113036]. However, contextual phenomena are found in other fields as well, for example database theory. In this paper, we shall develop this unified view of contextuality. We provide two main contributions: firstly, we expose a remarkable connection between contexuality and logical paradoxes; secondly, we show that an important class of contextuality arguments has a topological origin. More specifically, we show that "All-vs-Nothing" proofs of contextuality are witnessed by cohomological obstructions.
Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield
CSL5