Efficiently Controllable Graphs
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that, when a controllable quantum network is described by such a graph and the gaps in eigenfrequencies and in transition frequencies are bounded exponentially in...
| Main Authors: | , , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society,
2017-06-28T13:26:38Z.
|
| Subjects: | |
| Online Access: | Get fulltext |