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
|
| Online Access: | http://hdl.handle.net/1721.1/110346 https://orcid.org/0000-0003-4626-5648 |