Searcharxiv⌕ Search

arXiv subjects

Vanessa Brzić

Publications and source records attributed to Vanessa Brzić.

2 recordsLinked to original sources

Optimal physical approximations of pure-state cloning and transposition are complementary channels

State cloning and state transposition are fundamental transformations that, despite being desirable, cannot be perfectly realised as a consequence of two distinct requirements of quantum theory: cloning is forbidden by linearity, while transposition is ruled out by complete positivity. In this work, we show that, in spite of these disparate conceptual restrictions, the best physically allowed realisation of both transformations arises from a single physical process described by an isometry, which simultaneously implements their best possible approximations. This complementary relation allows us to determine the exact quantum and private classical capacities of the universal symmetric $N\to N+K$ cloning channel in the fully general multicopy qudit setting, thereby closing the remaining gap in the quantum capacity problem for universal cloning. We provide an explicit circuit that simultaneously implements optimal pure-state $N\to K$ transposition and optimal $N\to N+K$ symmetric cloning, both attaining the same fidelity. Additionally, we prove that the optimal $N\to K$ pure-state transposition channel is unique and realised by an estimation strategy. We also obtain the optimal mixed-state $N\to 1$ transposition, and discuss its differences from its pure-state analogue.

quant-ph↗

Higher-order quantum computing with known input states

In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed that the resulting operation must act on arbitrary, and thus unknown, input states. In this work, we explore a variant of this framework in which the operation remains unknown, but the input state is fixed and known. We argue that this assumption is well-motivated in certain practical contexts, such as unitary programming, and show that classical knowledge of the input state can significantly enhance performance. We demonstrate that in the SAR protocol, this knowledge leads to an exponential advantage through a repeat-until-success strategy, highlighting the operational power of known-state higher-order transformations. Moreover, this assumption allows us to distinguish between protocols designed for pure, bipartite, and mixed states, which enables us to identify the class of mixed states for which deterministic and exact implementation becomes possible.

quant-ph↗