Quantum computing of delocalization in small-world networks
arXiv:quant-ph/0503188 · doi:10.1103/PhysRevE.72.036203
Abstract
We study a quantum small-world network with disorder and show that the system exhibits a delocalization transition. A quantum algorithm is built up which simulates the evolution operator of the model in a polynomial number of gates for exponential number of vertices in the network. The total computational gain is shown to depend on the parameters of the network and a larger than quadratic speed-up can be reached. We also investigate the robustness of the algorithm in presence of imperfections.
4 pages, 5 figures, research done at http://www.quantware.ups-tlse.fr/
References in corpus (4)
- Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
- Dynamical localization simulated on a few qubits quantum computer
- Quantum and classical diffusion in small-world networks
- Quantum computation of the Anderson transition in presence of imperfections
Cited by in corpus (34)
- Limits of quantum speedup in photosynthetic light harvesting
- Google matrix analysis of directed networks
- Scaling theory of the Anderson transition in random graphs: ergodicity and universality
- Localization and its consequences for quantum walk algorithms and quantum communication
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- Two critical localization lengths in the Anderson transition on random graphs
- Multifractality of wave functions on a Cayley tree: From root to leaves
- Critical properties of the Anderson transition in random graphs: two-parameter scaling theory, Kosterlitz-Thouless type flow and many-body localization
- Universality in the spectral and eigenfunction properties of random networks
- Delocalization transition for the Google matrix
- Von Neumann entropy and localization-delocalization transition of electron states in quantum small-world networks
- Google matrix, dynamical attractors and Ulam networks
- Thermodynamic formalism for dissipative quantum walks
- Entanglement of localized states
- Normal mode analysis of spectra of random networks
- Scattering and transport properties of tight-binding random networks
- Entanglement Routers via Wireless Quantum Network Based on Arbitrary Two Qubit Systems
- Diffusion on a heptagonal lattice
- Symmetry Violation of Quantum Multifractality: Gaussian fluctuations versus Algebraic Localization
- Spatial Search Algorithms on Hanoi Networks
- Average diagonal entropy in non-equilibrium isolated quantum systems
- Quantum Charge Transport and Conformational Dynamics of Macromolecules
- Quantum Search Algorithms on Hierarchical Networks
- Dynamical decoherence of a qubit coupled to a quantum dot or the SYK black hole
- Weighted random--geometric and random--rectangular graphs: Spectral and eigenfunction properties of the adjacency matrix
- Anderson transition for Google matrix eigenstates
- Localization properties of a two-channel 3D Anderson model
- Quantum magnetism on small-world networks
- Fractional Moment Methods for Anderson Localization with SAW Representation
- Structure of multipartite entanglement in random cluster-like photonic systems
- Quantum walks assisted by particle number fluctuations
- Entanglement and localization of wavefunctions
- Time Reversibility of Quantum Diffusion in Small-world Networks
- Critical Dynamics of the Anderson Transition on Small-World Graphs