| dc.contributor.advisor | Sinha, Aninda | |
| dc.contributor.advisor | Sinha, Urbasi | |
| dc.contributor.author | Nath, Pingal Pratyush | |
| dc.date.accessioned | 2025-11-20T04:41:59Z | |
| dc.date.available | 2025-11-20T04:41:59Z | |
| dc.date.submitted | 2025 | |
| dc.identifier.uri | https://etd.iisc.ac.in/handle/2005/7466 | |
| dc.description.abstract | This thesis explores two complementary facets of quantum dynamics: the growth
of operator complexity in open quantum systems and the certification of quantum
randomness from temporal correlations in single-qubit dynamics. While these
problems differ in motivation and methodology, they are unified by a central theme:
understanding how quantum information evolves under coherent and dissipative
dynamics, and how this evolution can be harnessed both as a diagnostic and as a
resource.
The first part of the thesis addresses the question: How can we quantify the
complexity of information spreading in open quantum systems? To this end, we extend the
framework of Krylov complexity, originally developed for closed, unitary systems
to open quantum systems governed by non-unitary Lindbladian evolution. By
adapting iterative algorithms such as the Arnoldi and bi-Lanczos procedures, we
construct Krylov bases in non-Hermitian settings and define a normalized complexity
measure that accounts for probability decay. We derive quantum speed
limits on operator growth, identify regimes of universal complexity saturation, and
demonstrate how Krylov complexity remains sensitive to signatures of integrability
and chaos even in the presence of dissipation and decoherence.
The second part of the thesis poses the question: How can we certify genuine quantum
randomness without relying on spatially separated entangled systems? We develop
a semi-device-independent protocol for randomness certification based solely on
temporal quantum correlations. This method leverages violations of the Leggett-
Garg inequality, along with compliance with the No-Signaling-in-Time condition,
to establish rigorous lower bounds on certifiable randomness. We implement this
protocol on both a photonic setup and IBM’s superconducting quantum processors,
demonstrating that single-qubit circuits with low depth can produce certified randomness,
even in the presence of realistic noise, without requiring spatial separation
or entanglement.
Together, these investigations provide new tools for characterizing the dynamics
of quantum systems and highlight how foundational features of quantum evolution,
complexity and randomness, can be practically accessed and applied in near-term
quantum technologies. | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ;ET01148 | |
| dc.rights | I grant Indian Institute of Science the right to archive and to make available my thesis or dissertation in whole or in part in all forms of media, now hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part
of this thesis or dissertation | en_US |
| dc.subject | quantum evolution | en_US |
| dc.subject | quantum dynamics | en_US |
| dc.subject | quantum randomness | en_US |
| dc.subject | single-qubit dynamics | en_US |
| dc.subject | Krylov complexity | en_US |
| dc.subject | Arnoldi and bi-Lanczos procedures | en_US |
| dc.subject | superconducting quantum processors | en_US |
| dc.subject | Out-of-Time-Ordered Correlators | en_US |
| dc.subject | Bi-Lanczos algorithm | en_US |
| dc.subject | IBM Quantum Computers | en_US |
| dc.subject.classification | Research Subject Categories::NATURAL SCIENCES::Physics::Atomic and molecular physics | en_US |
| dc.title | Complexity and Randomness in the Dynamics of Quantum Systems | en_US |
| dc.type | Thesis | en_US |
| dc.degree.name | PhD | en_US |
| dc.degree.level | Doctoral | en_US |
| dc.degree.grantor | Indian Institute of Science | en_US |
| dc.degree.discipline | Faculty of Science | en_US |