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

Deutsch's algorithm is the first quantum algorithm to show the advantage overthe classical algorithm. Here we generalize Deutsch's problem to $n$ functionsand propose a new quantum algorithm with indefinite causal order to solve thisproblem. The new algorithm not only reduces the number of queries to theblack-box by half over the classical algorithm, but also significantly reducesthe number of required quantum gates over the Deutsch's algorithm. Weexperimentally demonstrate the algorithm in a stable Sagnac loop interferometerwith common path, which overcomes the obstacles of both phase instability andlow fidelity of Mach-Zehnder interferometer. The experimental results haveshown both an ultra-high and robust success probability $\sim 99.7\%$. Our workopens up a new path towards solving the practical problems with indefinitecasual order quantum circuits.

Experimentally demonstrating indefinite causal order algorithms to solve the generalized Deutsch's problem