Related papers: Geometric aspects of analog quantum search evoluti…
This thesis consists of several studies performed over different few-dof quantum systems exposed to the effect of an uncontrolled environment. The primary focus of the work is to explore the relation between decoherence and…
Classical hardness-of-sampling results are largely established for random quantum circuits, whereas analog simulators natively realize time evolutions under geometrically local Hamiltonians. Does a typical such Hamiltonian already yield…
We present a geometric formulation of quantum mechanics based on the symplectic structure of the projective Hilbert space. Building upon the standard K\"ahler framework, we introduce an extension in which the symplectic structure is allowed…
Non-Hermitian dynamics in quantum systems preserves the rank of the state density operator. Using this insight, we develop a geometric framework to describe its time evolution. In particular, we identify mutually orthogonal coherent and…
This paper develops a geometrodynamic extension of Bohmian mechanics to describe quantum tunneling through a potential barrier, treating particle trajectories as geodesics in an Alcubierre-type spacetime. The model provides analytical…
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum…
We present a unifying variational calculus derivation of Groverian geodesics for both quantum state vectors and quantum probability amplitudes. In the first case, we show that horizontal affinely parametrized geodesic paths on the Hilbert…
For any pair of quantum states, an initial state |I> and a final quantum state |F>, in a Hilbert space, there are many Hamiltonians H under which |I> evolves into |F>. Let us impose the constraint that the difference between the largest and…
This work examines the time complexity of quantum search algorithms on combinatorial $t$-designs with multiple marked elements using the continuous-time quantum walk. Through a detailed exploration of $t$-designs and their incidence…
Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and…
Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gained for searching unstructured lists. It yields a…
The study of quantum systems evolving from initial states to distinguishable, orthogonal final states is important for information processing applications such as quantum computing and quantum metrology. However, for most unitary evolutions…
We report on the recent results revealing the presence of geometric invariants in all the phenomena in which vacuum condensates appear and we show that Aharonov--Anandan phase can be used to provide the evidence of phenomena like Hawking…
Chakraborty and Leonardo have shown that a spatial search by quantum walk is optimal for almost all graphs. However, we observed that on some graphs, certain states cannot be searched optimally. We present a method for constructing an…
We use tools from the theory of dynamical systems with symmetries to stratify Uhlmann's standard purification bundle and derive a new connection for mixed quantum states. For unitarily evolving systems, this connection gives rise to the…
The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is…
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the…
The concept of off-diagonal geometric phases for mixed quantal states in unitary evolution is developed. We show that these phases arise from three basic ideas: (1) fulfillment of quantum parallel transport of a complete basis, (2) a…