Related papers: Experimentally demonstrating indefinite causal ord…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
In this work, we propose a new way to (non-interactively, verifiably) demonstrate quantum advantage by solving the average-case $\mathsf{NP}$ search problem of finding a solution to a system of (underdetermined) constant degree multivariate…
Quantum mechanics allows for coherent control over the order in which different processes take place on a target system, giving rise to a new feature known as indefinite causal order. Indefinite causal order provides a resource for quantum…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
The precision of quantum metrology is widely believed to be restricted by the Heisenberg limit, corresponding to a root mean square error that is inversely proportional to the number of independent processes probed in an experiment, N. In…
Quantum supermaps are transformations that map quantum operations to quantum operations. It is known that quantum supermaps which respect a definite, predefined causal order between their input operations correspond to fixed-order quantum…
Understanding the physical world fundamentally relies on the assumption that events are temporally ordered, with past events serving as causes for future ones. However, quantum mechanics permits events to occur in a superposition of causal…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
In the black-box model, problems constrained by a `promise' are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa…
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
It was recently found that the indefinite causal order in the quantum switch can be certified device-independently when assuming the impossibility of superluminal influences. Here we strengthen this result in two ways. First, we give a…
Modern machine learning (ML) methods typically fail to adequately capture causal information. Consequently, such models do not handle data distributional shifts, are vulnerable to adversarial examples, and often learn spurious correlations.…
In this "map" we are going to present the concept of indefinite causal order and make a quick journey through its different flavours. We will start with a broad conceptual motivation for studying indefinite causal order, based on the…
We demonstrate non-classical cooling on the IBMq cloud quantum computer. We implement a recently proposed refrigeration protocol which relies upon indefinite causal order for its quantum advantage. We use quantum channels which, when used…
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of…
Recent frameworks describing quantum mechanics in the absence of a global causal order admit the existence of causally indefinite processes, where it is impossible to ascribe causal order for events A and B. These frameworks even allow for…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the "genetic parameter vector" of the unitary transformations to be…