Quantum Hamiltonian simulation (QHS) is one of the fundamental quantum sub-routines in quantum physics and quantum computing. QHS prepares a unitary approximately within some error bound for a given Hamiltonian.…
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum programs has become a major concern. Pioneering research over the past years has proposed various approaches…
We discuss Bose's notion of indistinguishability at the combinatorial level as introduced by him in his seminal 1924 paper. We further describe its extension in a quantum mechanical setting and…
Entanglement detection and quantification of entanglement are the two most important problems in quantum information theory because quantum entanglement is a key resource in quantum information processing. I will divide…
Classical Bayes' rule lays the foundation for the classical causal relation between cause (input) and effect (output). This causal relation is believed to be universally true for all physical processes.…
Utkarsh is an alumnus of IIIT-H, where he worked with Professor Harjinder Singh for his masters. Currently, he is at Xanadu, working as a quantum scientist on quantum algorithms and…
Parallel query complexity is a generalization of query complexity in which one is allowed to make several non-adaptive queries to the input in each round. Here one counts the number…
