Sparse Probabilistic Synthesis of Quantum Operations
- URL: http://arxiv.org/abs/2402.15550v1
- Date: Fri, 23 Feb 2024 16:41:44 GMT
- Title: Sparse Probabilistic Synthesis of Quantum Operations
- Authors: B\'alint Koczor
- Abstract summary: Many applications require a desired quantum operation, such as rotation gates in quantum computing or broadband pulses in NMR or MRI applications.
This work develops an approach that enables -- at the cost of a modestly increased measurement repetition rate -- the exact implementation of such operations.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Successful implementations of quantum technologies require protocols and
algorithms that use as few quantum resources as possible. Many applications
require a desired quantum operation, such as rotation gates in quantum
computing or broadband pulses in NMR or MRI applications, that is not feasible
to directly implement or would require longer coherence times than achievable.
This work develops an approach that enables -- at the cost of a modestly
increased measurement repetition rate -- the exact implementation of such
operations. One proceeds by first building a library of a large number of
different approximations to the desired gate operation; by randomly selecting
these operations according to a pre-optimised probability distribution, one can
on average implement the desired operation with a rigorously controllable
approximation error. The approach relies on sophisticated tools from convex
optimisation to efficiently find optimal probability distributions. A diverse
spectrum of applications are demonstrated as (a) exactly synthesising rotations
in fault-tolerant quantum computers using only short T-depth circuits and (b)
synthesising broadband and band-selective pulses of superior performance in
quantum optimal control with (c) further applications in NMR or MRI. The
approach is very general and a broad spectrum of practical applications in
quantum technologies are explicitly demonstrated.
Related papers
- Surrogate optimization of variational quantum circuits [1.0546736060336612]
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications.
Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE.
arXiv Detail & Related papers (2024-04-03T18:00:00Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - 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) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems.
We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators.
The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
arXiv Detail & Related papers (2022-08-01T12:48:48Z) - Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum
Processors [1.195496689595016]
We study the framework in the context of qudits which are controllable electromagnetic modes of a superconducting cavity system.
We showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator.
arXiv Detail & Related papers (2022-01-19T18:55:13Z) - Estimating gate-set properties from random sequences [0.0]
Current quantum devices are only capable of short unstructured gate sequences followed by native measurements.
A single experiment - random sequence estimation - solves a wealth of estimation problems.
We derive robust channel variants of shadow estimation with close-to-optimal performance guarantees.
arXiv Detail & Related papers (2021-10-25T18:01:25Z) - Properties and Application of Gaussian Quantum Processes [0.0]
We show that generic coupler characterized by Gaussian unitary process can be transformed into a high-fidelity transducer.
We study the quantum noise theory for optical parameter sensing and its potential in providing great measurement precision enhancement.
All the analyses originated from the fundamental quantum commutation relations, and therefore are widely applicable.
arXiv Detail & Related papers (2021-07-03T18:01:34Z) - Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks.
Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55: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)
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.