Pith. sign in

REVIEW 1 cited by

Quantum computation with programmable connections between gates

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1109.5987 v2 pith:BZXUZSAU submitted 2011-09-27 quant-ph

Timoteo Colnaghi , Giacomo Mauro D'Ariano , Paolo Perinotti , Stefano Facchini This is my paper
classification quant-ph
keywords quantumcomputationchannelsconnectionsgatesmodelprogrammedswitch
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the "quantum switch", which can be programmed to switch the order of two channels with a single use of each one.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Routing Quantum Control of Causal Order

    quant-ph 2025-07 accept novelty 8.0 of 10

    Every N-party quantum circuit with quantum control of causal order can be represented as a routed quantum circuit built from one fixed routed graph G_QC-QC(N).

Pith tools