Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1512.01874

Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation

Mark Hillery
View original source ↗Read source document ↗Export metadata ↓

Abstract

That superpositions of states can be useful for performing tasks in quantum systems has been known since the early days of quantum information, but only recently has quantitative theory of quantum coherence been proposed. Here we apply that theory to an analysis of the Deutsch-Jozsa algorithm, which depends on quantum coherence for its operation. The Deutsch-Jozsa algorithm solves a decision problem, and we focus on a probabilistic version of that problem, comparing probability of being correct for both classical and quantum procedures. In addition, we study a related decision problem in which the quantum procedure has one-sided error while the classical procedure has two-sided error. The role of coherence on the quantum success probabilities in both of these problems is examined.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark Hillery. 2016-02-15. Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation. https://doi.org/10.1103/physreva.93.012111

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quantum Mechanics as a Reversible Diffusion Theory

This paper proposes an interpretation of quantum mechanics, relying on the time-symmetric stochastic dynamics of quantum particles and on non-classical probability theory. Our main purpose is to demonstrate that the wave function and its complex conjugate can be interpreted as complex probability distributions in two complex diffusion equations related to non-real forward and backward in time stochastic motions respectively. We say non-real because Schroedinger forward and backward diffusions describe both reversible (real trajectories) and irreversible trajectories (non-real trajectories). The reversible trajectories are the only real trajectories and are given by the intersection of those forward and backward processes. It turns out that if we translate this intersection using set-theoretic language, we are led to a reversible diffusion described by Born rule probabilities. This proposal is useful also for explaining more about the role of complex numbers in quantum mechanics that produces this so-called "wave-like" nature of quantum reality. Our perspective also challenges the notion of physical superposition and aims at a derivation of superposition principle not based on the linearity of Schroedinger's equation but relying on pure probability theory. Moreover, it is suggested that, embracing the idea of stochastic processes in quantum theory, explains the reasons for the appearance of classical behavior in large objects, in contrast to the quantum behavior of small ones. In other words, we claim that a combination of a probabilistic and no-ontic view (neither epistemic though) of the wave function with a stochastic hidden-variables approach, may provide some insight into the quantum physical reality and potentially establish the groundwork for a novel interpretation of quantum mechanics.

quant-ph↗
arXiv2026

Flexible Qubit Allocation of Network Resource States

The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node assignments. This flexibility enables adaptable engineering of the entanglement topology of an arbitrary quantum network. In particular, we focus on cluster states with arbitrary allocation as network resource states and as a promising candidate for a \textit{network core}-level entangled resource, due to its intrinsic flexible connectivity properties and resilience to particle losses. We introduce a modeling framework for overlaying entanglement topologies on physical networks and demonstrate how optimized and even random qubit assignment creates shortcuts and improves robustness and memory savings, while reducing the worst-case hop distance between remote network nodes, when compared to conventional approaches.

quant-ph↗
arXiv2026

Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions

We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for many computational methods such as the diagrammatic quantum Monte Carlo, a mathematically rigorous proof of polynomial runtime has been lacking. In this work we first extend the proof techniques developed in previous works for proving the convergence of the cumulant expansion in periodic systems to the non-periodic case. A key equation used to analyze the sum of connected Feynman diagrams, which we call the tree-determinant expansion, reveals an underlying tree structure in the summation. This enables us to design a new randomized algorithm to compute the log-partition function through importance sampling augmented by belief propagation. This approach differs from the traditional method based on Markov chain Monte Carlo, whose efficiency is hard to guarantee, and enables us to obtain a algorithm with provable polynomial runtime.

quant-ph↗