Related papers: Restoring broken symmetries using oracles
During the recent developments of quantum theory it has been clarified that the observable quantities (like energy or position) may be represented by operators (with real spectra) which are manifestly non-Hermitian. The mathematical…
In this work we consider the problem of recovering $n$ discrete random variables $x_i\in \{0,\ldots,k-1\}, 1 \leq i \leq n$ (where $k$ is constant) with the smallest possible number of queries to a noisy oracle that returns for a given…
In this work, we study the robust phase retrieval problem where the task is to recover an unknown signal $\theta^* \in \mathbb{R}^d$ in the presence of potentially arbitrarily corrupted magnitude-only linear measurements. We propose an…
This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty…
Using only linear interactions and a local parity measurement we show how entanglement can be detected between two harmonic oscillators. The scheme generalizes to measure both linear and non-linear functionals of an arbitrary oscillator…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
In his seminal work on recording quantum queries [Crypto 2019], Zhandry studied interactions between quantum query algorithms and the quantum oracle corresponding to random functions. Zhandry presented a framework for interpreting various…
Based on recently introduced efficient quantum state tomography schemes, we propose a scalable method for the tomography of unitary processes and the reconstruction of one-dimensional local Hamiltonians. As opposed to the exponential…
It is an established fact that for many of the interesting problems quantum algorithms based on queries of the standard oracle bring no significant improvement in comparison to known classical algorithms. It is conceivable that there are…
We revisit the so-called compressed oracle technique, introduced by Zhandry for analyzing quantum algorithms in the quantum random oracle model (QROM). To start off with, we offer a concise exposition of the technique, which easily extends…
We propose a paraxial quantum simulator that requires only widely available optical fibers or metamaterials. Such a simulator would facilitate cost-effective quantum simulation without specialized techniques. We show theoretically that the…
We show that measurement can recover the quantum coherence of a qubit in a non-Markovian environment. The experimental demonstration in an optical system is provided by comparing the visibilities (and fidelities) of the final states with…
Modern adiabatic quantum computers (AQC) are already used to solve difficult combinatorial optimisation problems in various domains of science. Currently, only a few applications of AQC in computer vision have been demonstrated. We review…
Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantially. Here, we demonstrate a hybrid framework that integrates…
We report an algorithm, based on quantum optics formulation, where a coherent state is used as the elementary quantum resource for the image representation. We provide an architecture with constituent optical elements in linear order with…
Iterative projection algorithms are successfully being used as a substitute of lenses to recombine, numerically rather than optically, light scattered by illuminated objects. Images obtained computationally allow aberration-free…
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…
We explore the possibility of using "weak" measurements to carry out quantum state tomography. Given a certain fixed number of copies of identically prepared states of a qubit, we simulate state tomography using weak as well as projective…