18 citations · 54 across the 9 of their papers we have counts for
11 papers
The generalised semi-Clifford conjecture is false
Nadish de Silva, Oscar Lautsch
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction scheme…
Three-qubit nonlocality paradoxes: beyond GHZ
Nadish de Silva, Santanil Jana, Ming Yin
Quantum nonlocality paradoxes, such as that of GHZ, provide maximally sharp logical obstructions to classical probabilistic models of quantum correlations. They are key resources i…
Bases for optimising stabiliser decompositions of quantum states
Nadish de Silva, Ming Yin, Sergii Strelchuk
Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correct…
Fast algorithms for classical specifications of stabiliser states and Clifford gates
Nadish de Silva, Wilfred Salmon, Ming Yin
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stab…
Characterising semi-Clifford gates using algebraic sets
Imin Chen, Nadish de Silva
Motivated by their central role in fault-tolerant quantum computation, we study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of `n…
Logical paradoxes in quantum computation
Nadish de Silva
While quantum computers are expected to yield considerable advantages over classical devices, the precise features of quantum theory enabling these advantages remain unclear. Conte…
Minimum quantum resources for strong non-locality
Samson Abramsky, Rui Soares Barbosa, Giovanni Carù +3
We analyse the minimum quantum resources needed to realise strong non-locality, as exemplified e.g. by the classical GHZ construction. It was already known that no two-qubit system…
The Quantum Monad on Relational Structures
Samson Abramsky, Rui Soares Barbosa, Nadish de Silva +1
Homomorphisms between relational structures play a central role in finite model theory, constraint satisfaction and database theory. A central theme in quantum computation is to sh…
Graph-theoretic strengths of contextuality
Nadish de Silva
Cabello-Severini-Winter and Abramsky-Hardy (building on the framework of Abramsky-Brandenburger) both provide classes of Bell and contextuality inequalities for very general experi…
A Concise, Elementary Proof of Arzelà's Bounded Convergence Theorem
Nadish de Silva
Arzelà's bounded convergence theorem (1885) states that if a sequence of Riemann integrable functions on a closed interval is uniformly bounded and has an integrable pointwise limi…
From Topology to Noncommutative Geometry: -theory
Nadish de Silva
We associate to each unital -algebra a geometric object---a diagram of topological spaces representing quotient spaces of the noncommutative space underlying ---meant t…