Approximate encoding of quantum states using shallow circuits
- URL: http://arxiv.org/abs/2207.00028v3
- Date: Mon, 21 Nov 2022 15:04:26 GMT
- Title: Approximate encoding of quantum states using shallow circuits
- Authors: Matan Ben Dov, David Shnaiderov, Adi Makmal, Emanuele G. Dalla Torre
- Abstract summary: A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates.
Here, we aim at creating an approximate encoding of the target state using a limited number of gates.
Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A common requirement of quantum simulations and algorithms is the preparation
of complex states through sequences of 2-qubit gates. For a generic quantum
state, the number of gates grows exponentially with the number of qubits,
becoming unfeasible on near-term quantum devices. Here, we aim at creating an
approximate encoding of the target state using a limited number of gates. As a
first step, we consider a quantum state that is efficiently represented
classically, such as a one-dimensional matrix product state. Using tensor
network techniques, we develop an optimization algorithm that approaches the
optimal implementation for a fixed number of gates. Our algorithm runs
efficiently on classical computers and requires a polynomial number of
iterations only. We demonstrate the feasibility of our approach by comparing
optimal and suboptimal circuits on real devices. We, next, consider the
implementation of the proposed optimization algorithm directly on a quantum
computer and overcome inherent barren plateaus by employing a local cost
function rather than a global one. By simulating realistic shot noise, we
verify that the number of required measurements scales polynomially with the
number of qubits. Our work offers a universal method to prepare target states
using local gates and represents a significant improvement over known
strategies.
Related papers
- Indirect Quantum Approximate Optimization Algorithms: application to the
TSP [1.1786249372283566]
Quantum Alternating Operator Ansatz takes into consideration a general parameterized family of unitary operators to efficiently model the Hamiltonian describing the set of vectors.
This algorithm creates an efficient alternative to QAOA, where: 1) a Quantum parametrized circuit executed on a quantum machine models the set of string vectors; 2) a Classical meta-optimization loop executed on a classical machine; 3) an estimation of the average cost of each string vector computing.
arXiv Detail & Related papers (2023-11-06T17:39:14Z) - An Alternative Approach to Quantum Imaginary Time Evolution [0.0]
We present an alternative approach to implement the imaginary-time (ITE) quantum algorithm.
We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept of.
We illustrate our algorithm through numerical implementation on an IBM quantum simulator.
arXiv Detail & Related papers (2022-08-22T18:33:31Z) - 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) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Quantum Gate Pattern Recognition and Circuit Optimization for Scientific
Applications [1.6329956884407544]
We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL.
AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics.
Our technique is generic and can be useful for a wide variety of quantum algorithms.
arXiv Detail & Related papers (2021-02-19T16:20:31Z) - Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm.
We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with.
Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
arXiv Detail & Related papers (2020-12-03T07:12:08Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - 2D Qubit Placement of Quantum Circuits using LONGPATH [1.6631602844999722]
Two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit.
Our approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
arXiv Detail & Related papers (2020-07-14T04:09:52Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
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.