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 offer an improved method for using a nuclear-magnetic-resonance quantumcomputer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to theapplication of the NMRQC are exponential diminishment of density-matrixelements with the number of bits, threatening weak signal levels, and the highcost of preparing a suitable starting state. A third obstacle is a heretoforeunnoticed restriction on measurement operators available for use by an NMRQC.Variations on the function classes of the Deutsch-Jozsa problem are introduced,both to extend the range of problems advantageous for quantum computation andto escape all three obstacles to use of an NMRQC. By adapting it to one suchfunction class, the Deutsch-Jozsa problem is made solvable without exponentialloss of signal. The method involves an extra work bit and a polynomially moreinvolved Oracle; it uses the thermal-equilibrium density matrix systematicallyfor an arbitrary number of spins, thereby avoiding both the preparation of apseudopure state and temporal averaging.Comment: 19 page

Rapid solution of problems by nuclear-magnetic-resonance quantum computation