Nonlinear and non-CP gates for Bloch vector amplification

• URL: http://arxiv.org/abs/2208.01804v2
• Date: Fri, 22 Sep 2023 20:17:54 GMT
• Title: Nonlinear and non-CP gates for Bloch vector amplification
• Authors: Michael R. Geller
• Abstract summary: We discuss the complementary state-preparation protocol for qubits at the center of the Bloch ball, r=0, based on increasing or amplifying |r| to its desired value, then rotating. Amplification can be achieved with a linear Markovian CPTP channel by placing the channel's fixed point away from r=0, making it nonunital, but the resulting gate suffers from a critical slowing down as that fixed point is approached. Here we consider alternative designs based on linear and nonlinear Markovian PTP channels, which offer benefits relative to linear CPTP channels, namely fast Bloch vector amplification without deceleration.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Any state r = (x,y,z) of a qubit, written in the Pauli basis and initialized in the pure state r = (0,0,1), can be prepared by composing three quantum operations: two unitary rotation gates to reach a pure state on the Bloch sphere, followed by a depolarization gate to decrease |r|. Here we discuss the complementary state-preparation protocol for qubits initialized at the center of the Bloch ball, r=0, based on increasing or amplifying |r| to its desired value, then rotating. Bloch vector amplification may or may not increase qubit energy, but it necessarily increases purity and decreases entropy. Amplification can be achieved with a linear Markovian CPTP channel by placing the channel's fixed point away from r=0, making it nonunital, but the resulting gate suffers from a critical slowing down as that fixed point is approached. Here we consider alternative designs based on linear and nonlinear Markovian PTP channels, which offer benefits relative to linear CPTP channels, namely fast Bloch vector amplification without deceleration. These operations simulate a reversal of the thermodynamic arrow of time for the qubit and would provide striking experimental demonstrations of non-CP dynamics.

Related papers

• Gate Fidelity and Gate Driven Dephasing via Time-Dependent Bloch-Redfield Master Equation [0.6036360355596617]
  This work examines driven qubit evolution in a bath of linear harmonic oscillators with a fast external drive. The interaction with the bath is investigated for its effect on gate fidelity.
  arXiv  Detail & Related papers  (2024-10-08T18:50:20Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosion [83.90492831583997]
  We show that a batch-normalized network can keep the optimal signal propagation properties, but avoid exploding gradients in depth. We use a Multi-Layer Perceptron (MLP) with linear activations and batch-normalization that provably has bounded depth. We also design an activation shaping scheme that empirically achieves the same properties for certain non-linear activations.
  arXiv  Detail & Related papers  (2023-10-03T12:35:02Z)
• Provable Training for Graph Contrastive Learning [58.8128675529977]
  Graph Contrastive Learning (GCL) has emerged as a popular training approach for learning node embeddings from augmented graphs without labels. We show that the training of GCL is indeed imbalanced across all nodes. We propose the metric "node compactness", which is the lower bound of how a node follows the GCL principle.
  arXiv  Detail & Related papers  (2023-09-25T08:23:53Z)
• Quantum simulation of dissipation for Maxwell equations in dispersive media [0.0]
  dissipation appears in the Schr"odinger representation of classical Maxwell equations as a sparse diagonal operator occupying an $r$-dimensional subspace. The unitary operators can be implemented through qubit lattice algorithm (QLA) on $n$ qubits. The non-unitary-dissipative part poses a challenge on how it should be implemented on a quantum computer.
  arXiv  Detail & Related papers  (2023-07-31T18:22:40Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Fast Evolution of Single Qubit Gate in Non-Adiabatic Geometric Quantum Computing [15.46216456374962]
  We implement arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The duration of gates grows from zero with the rotation angle $gamma$, and the tested T gate time can be reduced to $sim$40% of those in the traditional orange-sliced-shaped path non-adiabatic holonomic quantum computing scheme.
  arXiv  Detail & Related papers  (2022-05-17T08:08:19Z)
• Fast quantum state discrimination with nonlinear PTP channels [0.0]
  We investigate models of nonlinear quantum computation based on deterministic positive trace-preserving (PTP) channels and evolution equations. PTP channels support Bloch ball torsion and other distortions studied previously, where it has been shown that such nonlinearity can be used to increase the separation between a pair of close qubit states. We argue that this operation can be made robust to noise by using dissipation to induce a bifurcation to a novel phase where a pair of attracting fixed points create an intrinsically fault-tolerant nonlinear state discriminator.
  arXiv  Detail & Related papers  (2021-11-10T22:42:37Z)
• GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarization [84.57695474130273]
  Gate-based or importance-based pruning methods aim to remove channels whose importance is smallest. GDP can be plugged before convolutional layers without bells and whistles, to control the on-and-off of each channel. Experiments conducted over CIFAR-10 and ImageNet datasets show that the proposed GDP achieves the state-of-the-art performance.
  arXiv  Detail & Related papers  (2021-09-06T03:17:10Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• Quantum state preparation and one qubit logic from third-order nonlinear interactions [0.0]
  We present a study on preparing and manipulating path-like temporal-mode (TM) qubits based on third-order nonlinear interactions. Our study allows for experimentally feasible proposals capable of controllable arbitrary qubit transformations.
  arXiv  Detail & Related papers  (2021-03-06T04:15:15Z)

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.