Related papers: Quantum Query Complexity of Boolean Functions unde…
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of…
Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs…
Research on indefinite causal structures is a rapidly evolving field that has a potential not only to make a radical revision of the classical understanding of space-time but also to achieve enhanced functionalities of quantum information…
We study the query complexity of computing a function f:{0,1}^n-->R_+ in expectation. This requires the algorithm on input x to output a nonnegative random variable whose expectation equals f(x), using as few queries to the input x as…
Formalisms for higher order quantum processes provide a theoretical formalisation of quantum processes where the order of agents' operations need not be definite and acyclic, but may be subject to quantum superpositions. This has led to the…
One way to study the physical plausibility of closed timelike curves (CTCs) is to examine their computational power. This has been done for Deutschian CTCs (D-CTCs) and post-selection CTCs (P-CTCs), with the result that they allow for the…
We develop an extension of the process matrix (PM) framework for correlations between quantum operations with no causal order that allows multiple rounds of information exchange for each party compatibly with the assumption of well-defined…
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…
We reformulate Pearl's three rules of do-calculus in the language of completely positive (CP) trace-preserving maps, thereby extending them to quantum systems with entanglement. We prove that Rule~2 fails whenever the underlying process…
In the last few years, there has been increasing interest in quantum processes with indefinite causal order. Process matrices are a convenient framework to study such processes. Ref. [1] defines higher order transformations from process…
In Exact Quantum Query model, almost all of the Boolean functions for which non-trivial query algorithms exist are symmetric in nature. The most well known techniques in this domain exploit parity decision trees, in which the parity of two…
When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a…
Indefinite causal order has found numerous applications in quantum computation, quantum communication, and quantum metrology. Before its usage, the quality of the indefinite causal order needs to be first certified, and the certification…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Process matrices are a framework to model causal relations in the absence of a well-defined acyclic causal order. The framework is very general and does not even assume the existence of a background spacetime. As a result, it is an open…
Indefinite causal order is an evolving field with potential involvement in quantum technologies. Here we propose and study one possible scenario of practical application in quantum communication: a compound entanglement distillation…
Given a classical query algorithm as a decision tree, when does there exist a quantum query algorithm with a speed-up over the classical one? We provide a general construction based on the structure of the underlying decision tree, and…
Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing…
Quantum computing holds the potential to revolutionize various fields by efficiently tackling complex problems. At its core are quantum circuits, sequences of quantum gates manipulating quantum states. The selection of the right quantum…
Parameterized quantum circuits are the core of new technologies such as variational quantum algorithms and quantum machine learning, which makes studying its properties a valuable task. We implement parameterized circuits with definite and…