Contextuality as a resource for models of quantum computation with qubits
A central question in quantum computation is to identify the resources that are responsible
for quantum speed-up. Quantum contextuality has been recently shown to be a resource for …
for quantum speed-up. Quantum contextuality has been recently shown to be a resource for …
Further extensions of Clifford circuits and their classical simulation complexities
DE Koh - arxiv preprint arxiv:1512.07892, 2015 - arxiv.org
Extended Clifford circuits straddle the boundary between classical and quantum
computational power. Whether such circuits are efficiently classically simulable seems to …
computational power. Whether such circuits are efficiently classically simulable seems to …
Quantum advantage from energy measurements of many-body quantum systems
The problem of sampling outputs of quantum circuits has been proposed as a candidate for
demonstrating a quantum computational advantage (sometimes referred to as quantum" …
demonstrating a quantum computational advantage (sometimes referred to as quantum" …
Cohomological framework for contextual quantum computations
R Raussendorf - arxiv preprint arxiv:1602.04155, 2016 - arxiv.org
We describe a cohomological framework for measurement based quantum computation, in
which symmetry plays a central role. Therein, the essential information about the …
which symmetry plays a central role. Therein, the essential information about the …
Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems
$\textit {Normalizer circuits} $[1, 2] are generalized Clifford circuits that act on arbitrary finite-
dimensional systems $\mathcal {H} _ {d_1}\otimes...\otimes\mathcal {H} _ {d_n} $ with a …
dimensional systems $\mathcal {H} _ {d_1}\otimes...\otimes\mathcal {H} _ {d_n} $ with a …
Abelian hypergroups and quantum computation
J Bermejo-Vega, KC Zatloukal - arxiv preprint arxiv:1509.05806, 2015 - arxiv.org
Motivated by a connection, described here for the first time, between the hidden normal
subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions …
subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions …
Normalizer circuits and quantum computation
J Bermejo-Vega - arxiv preprint arxiv:1611.09274, 2016 - arxiv.org
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study
the emergence of quantum speed-up in quantum computer algorithms. Our first contribution …
the emergence of quantum speed-up in quantum computer algorithms. Our first contribution …
[PDF][PDF] THE JOURNEY OF QUANTUM INFORMATION TECHNOLOGY
P Nikolov, V Galabov - researchgate.net
This paper overviews the development of the quantum information technology and the
quantum computing over the years, highlighting its potential promising applications in …
quantum computing over the years, highlighting its potential promising applications in …
[PDF][PDF] The computational power of normalizer circuits over infinite and black-box groups
J Bermejo-Vega, CYY Lin, M Van den Nest - quantum-lab.org
Normalizer circuits [3, 4] are a family of quantum circuits which generalize Cli ord circuits [5
8] to Hilbert spaces associated with arbitrary nite abelian groups G= Zd1×···× Zdn …
8] to Hilbert spaces associated with arbitrary nite abelian groups G= Zd1×···× Zdn …