pith. sign in

arxiv: 0712.1325 · v1 · submitted 2007-12-09 · 🪐 quant-ph

Quantum Circuits Architecture

classification 🪐 quant-ph
keywords quantummethodarchitecturecircuitsaddressallowsboardchannels
0
0 comments X
read the original abstract

We present a method for optimizing quantum circuits architecture. The method is based on the notion of "quantum comb", which describes a circuit board in which one can insert variable subcircuits. The method allows one to efficiently address novel kinds of quantum information processing tasks, such as storing-retrieving, and cloning of channels.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The minimal example of quantum network Bell nonlocality

    quant-ph 2026-05 unverdicted novelty 8.0

    Quantum nonlocality is possible in the triangle network with no inputs and binary outputs, which is the smallest such scenario by number of variables and outcomes.

  2. Order structure and signalling in higher order quantum maps

    quant-ph 2026-04 unverdicted novelty 7.0

    Higher-order quantum map types form a distributive lattice of regular subtypes where signalling relations are determined by type function evaluations and structure poset rank parity, with normal forms derived from max...

  3. Probabilistic and approximate universal quantum purification machines

    quant-ph 2026-04 unverdicted novelty 7.0

    A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibi...

  4. Random dilation superchannel

    quant-ph 2025-12 unverdicted novelty 7.0

    Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an appli...

  5. Quantum Advantage in Storage and Retrieval of Isometry Channels

    quant-ph 2025-07 unverdicted novelty 7.0

    Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).

  6. Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

    quant-ph 2022-07 unverdicted novelty 7.0

    Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.