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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Emerging quantum algorithms for problems such as element distinctness, subsetsum, and closest pair demonstrate computational advantages by relying onabstract data structures. Practically realizing such an algorithm as a programfor a quantum computer requires an efficient implementation of the datastructure whose operations correspond to unitary operators that manipulatequantum superpositions of data.  To correctly operate in superposition, an implementation must satisfy threeproperties -- reversibility, history independence, and bounded-time execution.Standard implementations, such as the representation of an abstract set as ahash table, fail these properties, calling for tools to develop specializedimplementations.  In this work, we present Core Tower, the first language for quantumprogramming with random-access memory. Core Tower enables the developer toimplement data structures as pointer-based, linked data. It features areversible semantics enabling every valid program to be translated to a unitaryquantum circuit.  We present Boson, the first memory allocator that supports reversible,history-independent, and constant-time dynamic memory allocation in quantumsuperposition. We also present Tower, a language for quantum programming withrecursively defined data structures. Tower features a type system that boundsall recursion using classical parameters as is necessary for a program toexecute on a quantum computer.  Using Tower, we implement Ground, the first quantum library of datastructures, including lists, stacks, queues, strings, and sets. We provide thefirst executable implementation of sets that satisfies all three mandatedproperties of reversibility, history independence, and bounded-time execution.

Tower: Data Structures in Quantum Superposition