Related papers: A Quantum Algorithm for Testing Juntas in Boolean …
Self testing is a device independent approach to estimate the state and measurement operators, without the need to assume the dimension of our quantum system. In this paper, we show that one can self test black boxes into any pure entangled…
Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have…
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown…
The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type methods that cap the possible advantage at only quadratic…
We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.
A new methodology is proposed to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). Our methodology successfully finds all optimized approximated solutions for Boolean problems,…
Identifying the Hamiltonian of a quantum system from experimental data is considered. General limits on the identifiability of model parameters with limited experimental resources are investigated, and a specific Bayesian estimation…
Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Bounds on their performance, derived in the…
We study quantum algorithms for verifying properties of the output probability distribution of a classical or quantum circuit, given access to the source code that generates the distribution. We consider the basic task of uniformity…
Joint state and parameter estimation is a core problem for dynamic Bayesian networks. Although modern probabilistic inference toolkits make it relatively easy to specify large and practically relevant probabilistic models, the silver…
In this work, we propose a simple but effective experiment for probing the boundary in which a wave-function collapses. Using a quantum optics system interacting with a photomultiplier tube (PMT), one is able to determine the number of…
Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting…
We present a variational algorithm for fault tolerant quantum computing to solve a system of linear equations which directly maximises the parameters of the target fidelity. This so-called measurement test algorithm can be applied to any…
A quantum simulator is a device engineered to reproduce the properties of an ideal quantum model. It allows the study of quantum systems that cannot be efficiently simulated on classical computers. While a universal quantum computer is also…
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups…
This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean…
The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to…
Suppose one has access to oracles generating samples from two unknown probability distributions P and Q on some N-element set. How many samples does one need to test whether the two distributions are close or far from each other in the…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
We show that for any constant $\epsilon > 0$ and $p \ge 1$, it is possible to distinguish functions $f : \{0,1\}^n \to [0,1]$ that are submodular from those that are $\epsilon$-far from every submodular function in $\ell_p$ distance with a…