Kang Feng Ng

dblp:202/2546 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Theory of computation · 2

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 · 80% Logic in computer science · 20%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
categorical quantum mechanics
0.312018
Two complete axiomatisations of pure-state qubit quantum computing · LICS 2018
Logic in computer science › completeness
complete axiomatization
0.312018
Two complete axiomatisations of pure-state qubit quantum computing · LICS 2018
Quantum computing and quantum information › categorical quantum mechanics
graphical calculi
0.312018
Two complete axiomatisations of pure-state qubit quantum computing · LICS 2018
Quantum computing and quantum information › categorical quantum mechanics › graphical calculi
ZW-calculus
0.312018
Two complete axiomatisations of pure-state qubit quantum computing · LICS 2018
Quantum computing and quantum information › categorical quantum mechanics › graphical calculi
ZX-calculus
0.312018
Two complete axiomatisations of pure-state qubit quantum computing · LICS 2018

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

equational reasoning · 0.3compact closed categories · 0.3
YearPublicationVenuePosition
2019 A diagrammatic calculus of fermionic quantum circuits
abstract
We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and show how the main physical gates of interest in FQC can be represented in our language. We then list our axioms, and derive some additional equations. We prove that the axioms provide a complete equational axiomatisation of the monoidal category whose objects are systems of finitely many local fermionic modes (LFMs), with maps that preserve or reverse the parity of states, and the tensor product as monoidal product. We achieve this through a procedure that rewrites any diagram in a normal form. As an example, we show how the statistics of a fermionic Mach-Zehnder interferometer can be calculated in the diagrammatic language. We conclude by giving a diagrammatic treatment of the dual-rail encoding, a standard method in optical quantum computing used to perform universal quantum computation.
Giovanni de Felice, Amar Hadzihasanovic, Kang Feng Ng
Log. Methods Comput. Sci.3
2018 Two complete axiomatisations of pure-state qubit quantum computing
abstract
Categorical quantum mechanics places finite-dimensional quantum theory in the context of compact closed categories, with an emphasis on diagrammatic reasoning. In this framework, two equational diagrammatic calculi have been proposed for pure-state qubit quantum computing: the ZW calculus, developed by Coecke, Kissinger and the first author for the purpose of qubit entanglement classification, and the ZX calculus, introduced by Coecke and Duncan to give an abstract description of complementary observables. Neither calculus, however, provided a complete axiomatisation of their model.
Amar Hadzihasanovic, Kang Feng Ng
LICS2