Related papers: Restoring broken symmetries using oracles

We introduce a variational quantum computing approach for quantum state reconstruction within a discretized logical framework, using experimental measurement data as input. By mapping the reconstruction cost function onto an Ising model,…

In this paper, we present an algorithm for effectively reconstructing an object from a set of its tomographic projections without any knowledge of the viewing directions or any prior structural information, in the presence of pathological…

We investigate the quantum algorithm of Babbush et al. (arXiv:2303.13012v3) for simulating coupled harmonic oscillators, which promises exponential speedups over classical methods. Focusing on linearly connected oscillator chains, we bridge…

Noise poses a challenge for any real-world implementation in quantum information science. The theory of quantum error correction deals with this problem via methods to encode and recover quantum information in a way that is resilient…

Quantum computing is a promising approach to harnessing strong correlation in molecular systems; however, current devices only allow for hybrid quantum-classical algorithms with a shallow circuit depth, such as the variational quantum…

We study mirror symmetry (A-side vs B-side) in the framework of quantum differential systems. We focuse on the logarithmic and non-resonant case, which describes the geometric situation. We show that quantum differential systems provide a…

Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation.…

Quantum simulators, in which well controlled quantum systems are used to reproduce the dynamics of less understood ones, have the potential to explore physics that is inaccessible to modeling with classical computers. However, checking the…

Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…

We apply a variational method devised for the nuclear many--body problem to the 1-dimensional Hubbard--model with nearest neighbor hopping and periodic boundary conditions. The test wave function consist for each state out of a single…

We co-design a family of quantum eigenvalue transformation oracles that can be efficiently implemented on hybrid discrete/continuous-variable (qubit/qumode) hardware. To illustrate the oracle's representation-theoretic power and near-term…

We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…

The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. In this paper, we focus on the basic problem of correcting faulty or adversarially corrupted random oracles, so that…

Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…

We study the tomography of multispin quantum states in the context of finite-dimensional Wigner representations. An arbitrary operator can be completely characterized and visualized using multiple shapes assembled from linear combinations…

Recent works have developed new projection-free first-order methods based on utilizing linesearches and normal vector computations to maintain feasibility. These oracles can be cheaper than orthogonal projection or linear optimization…

We implement an algorithm which is aimed to reduce the number of basis states spanning the Hilbert space of quantum many-body systems. We test the efficiency of the procedure by working out and analyzing the spectral properties of strongly…

We propose a classical to quantum information encoding system using non--orthogonal states and apply it to the problem of searching an element in a quantum list. We show that the proposed encoding scheme leads to an exponential gain in…

We describe a new implementation of the Bernstein-Vazirani algorithm which relies on the fact that the polarization states of classical light beams can be cloned. We explore the possibility of computing with waves and discuss a classical…

Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learning task using only a fixed number of queries. In this work,…