pith. machine review for the scientific record. sign in

arxiv: 1309.7976 · v2 · submitted 2013-09-30 · 🪐 quant-ph

Recognition: unknown

Quantum circuits cannot control unknown operations

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords controlquantumunknownunitarycannotcircuitunitariesadditional
0
0 comments X
read the original abstract

One of the essential building blocks of classical computer programs is the "if" clause, which executes a subroutine depending on the value of a control variable. Similarly, several quantum algorithms rely on applying a unitary operation conditioned on the state of a control system. Here we show that this control cannot be performed by a quantum circuit if the unitary is completely unknown. However, this no-go theorem does not prevent implementing quantum control of unknown unitaries in practice, as any physical implementation of an unknown unitary provides additional information that makes the control possible. We then argue that one should extend the quantum circuit formalism to capture this possibility in a straightforward way. This is done by allowing unknown unitaries to be applied to subspaces and not only to subsystems.

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 1 Pith paper

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

  1. 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...