3 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Classical Simulation of Quantum CSP Strategies
Demian Banakh, Lorenzo Ciardo, Marcin Kozik +1
We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra…
Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets
Jan Tułowiecki, Łukasz Czerwiński, Konrad Deka +3
Various quantum algorithms require usage of arbitrary diagonal operators as subroutines. For their execution on a physical hardware, those operators must be first decomposed into t…
Clifford circuits over non-cyclic abelian groups
Milo Moses, Jacek Horecki, Konrad Deka +1
We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correctio…
Efficient unstructured search implementation on current ion-trap quantum processors
Vladyslav Hlembotskyi, Rafał Burczyński, Witold Jarnicki +2
So far, only the results on 3 qubit spaces (both on superconducting and ion-trap realisations of quantum processors) have beaten the classical unstructured search in the expected n…