Quantum eigenstate broadcasting assisted by a coherent link
- URL: http://arxiv.org/abs/2302.03017v1
- Date: Mon, 6 Feb 2023 18:56:08 GMT
- Title: Quantum eigenstate broadcasting assisted by a coherent link
- Authors: Benjamin F. Schiffer, Jordi Tura
- Abstract summary: We show that the circuit depth of the eigenstate preparation algorithm can be reduced when the devices can share limited entanglement.
Our approach requires only a single auxiliary qubit per device to be entangled with the outside.
We show that, in the near-convergent regime, the average relative suppression of unwanted amplitudes is improved to $1/(2sqrte) approx 0.30$ per run of the protocol.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Preparing the ground state of a local Hamiltonian is a crucial problem in
understanding quantum many-body systems, with applications in a variety of
physics fields and connections to combinatorial optimization. While various
quantum algorithms exist which can prepare the ground state with high precision
and provable guarantees from an initial approximation, current devices are
limited to shallow circuits. Here we consider the setting where Alice and Bob,
in a distributed quantum computing architecture, want to prepare the same
Hamiltonian eigenstate. We demonstrate that the circuit depth of the eigenstate
preparation algorithm can be reduced when the devices can share limited
entanglement. Especially so in the case where one of them has a near-perfect
eigenstate, which is more efficiently broadcast to the other device. Our
approach requires only a single auxiliary qubit per device to be entangled with
the outside. We show that, in the near-convergent regime, the average relative
suppression of unwanted amplitudes is improved to $1/(2\sqrt{e}) \approx 0.30$
per run of the protocol, outperforming the average relative suppression of
$1/e\approx 0.37$ achieved with a single device alone for the same protocol.
Related papers
- Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity.
We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace.
Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
arXiv Detail & Related papers (2024-04-15T17:51:47Z) - $\mathcal{PT}$-symmetric mapping of three states and its implementation on a cloud quantum processor [0.9599644507730107]
We develop a new $mathcalPT$-symmetric approach for mapping three pure qubit states.
We show consistency with the Hermitian case, conservation of average projections on reference vectors, and Quantum Fisher Information.
Our work unlocks new doors for applying $mathcalPT$-symmetry in quantum communication, computing, and cryptography.
arXiv Detail & Related papers (2023-12-27T18:51:33Z) - Single-Layer Digitized-Counterdiabatic Quantum Optimization for $p$-spin
Models [8.463477025989542]
We take advantage of a digitized-counterdiabatic quantum optimization (DCQO) algorithm to find an optimal solution of the $p$-spin model up to 4-local interactions.
By further optimizing parameters using variational methods, we solve with unit accuracy 2-spin, 3-spin, and 4-spin problems for $100%$, $93%$, and $83%$ of instances, respectively.
arXiv Detail & Related papers (2023-11-11T22:49:16Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Even shorter quantum circuit for phase estimation on early
fault-tolerant quantum computers with applications to ground-state energy
estimation [5.746732081406236]
We develop a phase estimation method with a distinct feature.
The total cost of the algorithm satisfies the Heisenberg-limited scaling $widetildemathcalO(epsilon-1)$.
Our algorithm may significantly reduce the circuit depth for performing phase estimation tasks on early fault-tolerant quantum computers.
arXiv Detail & Related papers (2022-11-22T03:15:40Z) - Optimal quantum control via genetic algorithms for quantum state
engineering in driven-resonator mediated networks [68.8204255655161]
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms.
We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator.
We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
arXiv Detail & Related papers (2022-06-29T14:34:00Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Unimon qubit [42.83899285555746]
Superconducting qubits are one of the most promising candidates to implement quantum computers.
Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
arXiv Detail & Related papers (2022-03-11T12:57:43Z) - 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) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - 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.