.png){kind=icon}
Return
Addressable Quantum Gates
.png){kind=icon}
OA
AI
DOI：10.1145/3581760.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
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
Journal
A
IF:
6.8
Papers:
540
Citations:
508
Organization
View more organizations
Cited Papers
Spiritual Religious Coping is Associated with Quality of Life in Institutionalized Older Adults
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave View more