Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware
- URL: http://arxiv.org/abs/2412.14544v1
- Date: Thu, 19 Dec 2024 05:50:54 GMT
- Title: Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware
- Authors: Alexander Yosifov, Aditya Iyer, Daniel Ebler, Vlatko Vedral,
- Abstract summary: Quantum homogenization is a reservoir-based quantum state approximation protocol.
We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.
We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
- Score: 42.52549987351643
- License:
- Abstract: Quantum homogenization is a reservoir-based quantum state approximation protocol, which has been successfully implemented in state transformation on quantum hardware. In this work we move beyond that and propose the homogenization as a novel platform for quantum state stabilization and information protection. Using the Heisenberg exchange interactions formalism, we extend the standard quantum homogenization protocol to the dynamically-equivalent ($\mathtt{SWAP}$)$^\alpha$ formulation. We then demonstrate its applicability on available noisy intermediate-scale quantum (NISQ) processors by presenting a shallow quantum circuit implementation consisting of a sequence of $\mathtt{CNOT}$ and single-qubit gates. In light of this, we employ the Beny-Oreshkov generalization of the Knill-Laflamme (KL) conditions for near-optimal recovery channels to show that our proposed ($\mathtt{SWAP}$)$^\alpha$ quantum homogenization protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable. Therefore, the protocol protects quantum information contained in a subsystem of the reservoir Hilbert space under CPTP dynamics.
Related papers
- Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Compact fermionic quantum state preparation with a natural-orbitalizing variational quantum eigensolving scheme [0.0]
Near-term quantum state preparation is typically realized by means of the variational quantum eigensolver (VQE) algorithm.
We present a refined VQE scheme that consists in topping VQE with state-informed updates of the elementary fermionic modes.
For a fixed circuit structure, the method is shown to enhance the capabilities of the circuit to reach a state close to the target state without incurring too much overhead from shot noise.
arXiv Detail & Related papers (2024-06-20T10:23:28Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Quantum Computation Using Large Spin Qudits [0.0]
dissertation explores quantum computation using qudits encoded into large spins.
First, we delve into the generation of high-fidelity universal gate sets for quantum computation with qudits.
Next, we analyze schemes to encode a qubit in the large spin qudits for fault-tolerant quantum computation.
arXiv Detail & Related papers (2024-05-13T16:19:31Z) - Robust black-box quantum-state preparation via quantum signal processing [0.0]
Black-box quantum-state preparation is a variant of quantum-state preparation where we want to construct an $n$-qubit state $|psi_crangle propto sum_x c(x) |xrangle$ with the amplitudes $c(x)$ given as a (quantum) oracle.
We use recent techniques, namely quantum signal processing (QSP) and quantum singular value transform (QSVT), to construct a new algorithm that prepares $|psi_crangle$ without the need to carry out coherent arithmetic.
arXiv Detail & Related papers (2023-05-08T13:37:25Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - On Zero-Knowledge Proofs over the Quantum Internet [0.0]
This paper presents a new method for quantum identity authentication (QIA) protocols.
The logic of classical zero-knowledge proofs (ZKPs) due to Schnorr is applied in quantum circuits and algorithms.
arXiv Detail & Related papers (2022-12-06T14:57:00Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - 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.