Reassessing the computational advantage of quantum-controlled ordering
of gates
- URL: http://arxiv.org/abs/2102.11293v1
- Date: Mon, 22 Feb 2021 19:00:08 GMT
- Title: Reassessing the computational advantage of quantum-controlled ordering
of gates
- Authors: Martin J. Renner, \v{C}aslav Brukner
- Abstract summary: In quantum computation, indefinite causal structures decide whether two unitary gates commute or anticommute with a single call to each gate.
In this work, we show that this advantage is smaller than expected.
We present a causal algorithm that solves the only known specific FPP with $O(nlog(n))$ queries and a causal algorithm that solves every FPP with $O(nsqrtn)$ queries.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 processing. For example, it is known that indefinite causal
structures provide exponential advantage in communication complexity when
compared to causal protocols. In quantum computation, such structures can
decide whether two unitary gates commute or anticommute with a single call to
each gate, which is impossible with conventional (causal) quantum algorithms. A
generalization of this effect to $n$ unitary gates, originally introduced in M.
Ara\'ujo et al., Phys. Rev. Lett. 113, 250402 (2014) and often called Fourier
promise problem (FPP), can be solved with the quantum-$n$-switch and a single
call to each gate, while the best known causal algorithm so far calls $O(n^2)$
gates. In this work, we show that this advantage is smaller than expected. In
fact, we present a causal algorithm that solves the only known specific FPP
with $O(n \log(n))$ queries and a causal algorithm that solves every FPP with
$O(n\sqrt{n})$ queries. Besides the interest in such algorithms on their own,
our results limit the expected advantage of indefinite causal structures for
these problems.
Related papers
- Halving the Cost of Quantum Algorithms with Randomization [0.138120109831448]
Quantum signal processing (QSP) provides a systematic framework for implementing a transformation of a linear operator.
Recent works have developed randomized compiling, a technique that promotes a unitary gate to a quantum channel.
Our algorithm implements a probabilistic mixture of randomizeds, strategically chosen so that the average evolution converges to that of a target function, with an error quadratically smaller than that of an equivalent individual.
arXiv Detail & Related papers (2024-09-05T17:56:51Z) - Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP)
We generalize the SDP-inspired quantum algorithm to sum-of-squares.
Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
arXiv Detail & Related papers (2024-08-14T19:04:13Z) - Quantum Query Complexity of Boolean Functions under Indefinite Causal
Order [0.9208007322096533]
We study the query complexity of Boolean functions under general higher order quantum computations.
We show that the recently introduced class of quantum circuits with quantum control of causal order cannot lead to any reduction in query complexity.
We find some functions for which the minimum error with which they can be computed using two queries is strictly lower when exploiting causally indefinite supermaps.
arXiv Detail & Related papers (2023-07-18T13:12:55Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Resource Optimisation of Coherently Controlled Quantum Computations with
the PBS-calculus [55.2480439325792]
Coherent control of quantum computations can be used to improve some quantum protocols and algorithms.
We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
arXiv Detail & Related papers (2022-02-10T18:59:52Z) - Experimentally feasible computational advantage from quantum
superposition of gate orders [0.0]
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems.
The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state.
It is known that this quantum-controlled ordering of gates can reduce the query complexity in deciding a property of black-box unitaries with respect to the best algorithm in which gates are applied in a fixed order.
arXiv Detail & Related papers (2021-12-29T13:36:27Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Quantum Logarithmic Space and Post-selection [0.4588028371034406]
Post-selection is an influential concept introduced to the field of quantum complexity theory by Aaronson (Proceedings of the Royal Society A, 2005)
Our main result shows the identity $sf PostBQL=$, i.e., the class of problems that can be solved by a bounded-error (polynomial-time) logarithmic-space quantum algorithm with post-selection ($sf PostBQL$)
We also show that $sf$ coincides with the class of problems that can be solved by bounded-error logarithmic-space quantum algorithms that have no time bound.
arXiv Detail & Related papers (2021-05-06T14:02:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.