Nonunitary Gate Operations by Dissipation Engineering
- URL: http://arxiv.org/abs/2201.12330v1
- Date: Fri, 28 Jan 2022 18:53:10 GMT
- Title: Nonunitary Gate Operations by Dissipation Engineering
- Authors: E. Zapusek, A. Javadi, F. Reiter
- Abstract summary: We propose protocols that harness dissipation to realize the nonunitary evolution required for irreversible gate operations.
We exemplify our approach considering several classical logic operations, such as the OR, NOR, and XOR gates.
Our study shows that irreversible logic operations can be efficiently performed on realistic quantum systems and that dissipation engineering is an essential tool for obtaining nonunitary evolutions.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Irreversible logic is at odds with unitary quantum evolution. Emulating such
operations by classical measurements can result in disturbances and high
resource demands. To overcome these limitations, we propose protocols that
harness dissipation to realize the nonunitary evolution required for
irreversible gate operations. Using additional excited states subject to decay,
we engineer effective decay processes that perform the desired gate operations
on the smallest stable Hilbert space. These operate deterministically and in an
autonomous fashion, without the need for measurements. We exemplify our
approach considering several classical logic operations, such as the OR, NOR,
and XOR gates. Towards experimental realization, we discuss a possible
implementation in quantum dots. Our study shows that irreversible logic
operations can be efficiently performed on realistic quantum systems and that
dissipation engineering is an essential tool for obtaining nonunitary
evolutions. The proposed operations expand the quantum engineers' toolbox and
have promising applications in NISQ algorithms and quantum machine learning.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Nonadiabatic geometric quantum gates with on-demand trajectories [2.5539863252714636]
We propose a general protocol for constructing geometric quantum gates with on-demand trajectories.
Our scheme adopts reverse engineering of the target Hamiltonian using smooth pulses.
Because a particular geometric gate can be induced by various different trajectories, we can further optimize the gate performance.
arXiv Detail & Related papers (2024-01-20T06:57:36Z) - 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) - Deterministic and universal quantum squeezing gate in virtue of
teleportation-like protocol [2.846690021852171]
We develop and demonstrate a new scheme of deterministic and universal quantum squeezing gate with the property of non-local operation.
Our method can be applied to distributed quantum processor, the creation of exotic non-classical states, and quantum error correction.
arXiv Detail & Related papers (2022-02-15T02:10:28Z) - Analytical and experimental study of center line miscalibrations in M\o
lmer-S\o rensen gates [51.93099889384597]
We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate.
We compute the gate evolution operator which allows us to obtain relevant key properties.
We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
arXiv Detail & Related papers (2021-12-10T10:56:16Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Noncyclic nonadiabatic holonomic quantum gates via shortcuts to
adiabaticity [5.666193021459319]
We propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum systems via shortcuts to adiabaticity.
Our scheme is readily realizable in physical system currently pursued for implementation of quantum computation.
arXiv Detail & Related papers (2021-05-28T15:23:24Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Probabilistic Nonunitary Gate in Imaginary Time Evolution [19.255769538019106]
We extend the probabilistic method of implementing nonunitary operation and show that it can promote success probability without fidelity decreasing.
This method can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.
arXiv Detail & Related papers (2020-06-17T08:56:06Z) - Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting
Circuits [4.354697470999286]
We propose a simplified implementation of universal holonomic quantum gates on superconducting circuits.
Our scheme is more robust than the conventional ones, and thus provides a promising alternative strategy for scalable fault-tolerant quantum computation.
arXiv Detail & Related papers (2020-04-23T13:26:18Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z)
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.