Addressable quantum gates

arxiv(2023)

引用 0|浏览5
暂无评分
摘要
We extend the circuit model of quantum computation so that the wiring between gates is soft-coded within registers inside the gates. The addresses in these registers can be manipulated and put into superpositions. This aims at capturing indefinite causal orders and making their geometrical layout explicit: we express the quantum switch and the polarizing beam-splitter within the model. In this context, our main contribution is a full characterization of the anonymity constraints. Indeed, the names used as addresses should not matter beyond the wiring they describe, i.e. quantum evolutions should commute with "renamings". We show that these quantum evolutions can still act non-trivially upon the names. We specify the structure of "nameblind" matrices.
更多
查看译文
关键词
Models of distributed quantum computing, anonymous, identityoblivious, alpha equivalence, name-invariance, covariance, Markovian dynamic graphs, timed quantum circuits, clocked quantum circuits, quantum causal graph dynamics, quantum controllable quantum circuits, quantum FPGA
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要