Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Bocharov, Alex"'
A school of thought contends that human decision making exhibits quantum-like logic. While it is not known whether the brain may indeed be driven by actual quantum mechanisms, some researchers suggest that the decision logic is phenomenologically non
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ddbd247a79bf058449fe7e86f98c42b4
http://arxiv.org/abs/2004.04671
http://arxiv.org/abs/2004.04671
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is asymptotic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2786974daf4d473cdf28ed350852711
http://arxiv.org/abs/1510.03888
http://arxiv.org/abs/1510.03888
Qutrit (or ternary) structures arise naturally in many quantum systems, particularly in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0517b2537b24bad5b63d86e318b23db9
Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a $2.5$ times reduction in expected $T$-count over ancilla-free techniques for single-qubit unitary decomposition. However, the previously best known algorithm to synthesize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8965691aa29b9157ecae2730bf0fad38