Related papers: On the Physical Explanation for Quantum Computatio…
Complete quantum charging provides a sharp setting in which to ask how much multipartite entanglement is forced by speed itself. For a closed \(N\)-qubit battery evolving from \(\ket{\downarrow}^{\otimes N}\) to \(\ket{\uparrow}^{\otimes…
A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime…
Quantum speed limits are relations yielding lower bounds on the evolution time of quantum systems. These results have been generalized in some ways, in particular by including evolutions to non-orthogonal states. However, there was a gap in…
The intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question: {\it When and how will quantum computers outperform classical computers?} The next milestone is undoubtedly…
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…
The notion of entanglement of quantum states is usually defined with respect to a fixed bipartition. Indeed, a global basis change can always map an entangled state to a separable one. The situation is however different when considering a…
In this paper we present a new unified theoretical framework that describes the full dynamics of quantum computation. Our formulation allows any questions pertaining to the physical behavior of a quantum computer to be framed, and in…
Entangled many-body states are an essential resource for quantum computing and interferometry. Determining the type of entanglement present in a system usually requires access to an exponential number of parameters. We show that in the case…
The concept of quantum speed limit-time (QSL) was initially introduced as a lower bound to the time interval that a given initial state $\psi_I$ may need so as to evolve into a state orthogonal to itself. Recently [V. Giovannetti, S. Lloyd,…
One of the greatest challenges in quantum information processing is the coherent control over quantum systems with an ever increasing number of particles. Within this endeavor, the harnessing of many-body entanglement against the effects of…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite entanglement in a typical instance of the…
We construct a general measure for detecting the quantum speedup in both closed and open systems. The speed measure is based on the changing rate of the position of quantum states on a manifold with appropriate monotone Riemannian metrics.…
Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
Interaction with environment may lead to the transition of quantum system from pure state to the mixed one. In this case, the problem of definition of entanglement may arise. In particular, quantitative measure of entanglement concurrence…
A quantum computing system is typically represented by a set of non-interacting (local) two-state systems - qubits. Many physical systems can naturally have more accessible states, both local and non-local. We show that the resulting…
We prove that the time required for sustained information scrambling in any Hamiltonian quantum system is universally at least logarithmic in the entanglement entropy of scrambled states. This addresses two foundational problems in…
'Tis said, to know others is to be learned, to know oneself, wise - I demonstrate that it could be more fundamental than knowing the rest of nature, by applying classical computational principles and engineering hindsight to derive and…
Quantum superposition says that any physical system simultaneously exists in all of its possible states, the number of which is exponential in the number of entities composing the system. The strength of presence of each possible state in…