English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider quantum computation efficiency from a new perspective. Theefficiency is reduced to its classical counterpart by imposing thesemi-classical limit. We show that this reduction is caused by the fact thatany elementary quantum logic operation (gate) suffers information loss duringtransition to its classical analogue. Amount of the information lost isestimated for any gate from the complete set. The largest loss is obtained fornon-commuting gates that allows to consider them as quantum computationalspeed-up resource. Our method allows to quantify advantages of quantumcomputation as compared to the classical one by direct analysis of the basiclogic involved. The obtained results are illustrated by application to quantumdiscrete Fourier transform and Grover search algorithms.

Quantum logic under semi-classical limit: information loss