Engineering Perfect State Transfer Graphs via Givens Transformations

• URL: http://arxiv.org/abs/2604.02536v1
• Date: Thu, 02 Apr 2026 21:40:06 GMT
• Title: Engineering Perfect State Transfer Graphs via Givens Transformations
• Abstract summary: Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc.<n>We present a scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission.
• Score: 42.27843435279468
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with homogeneous interactions. These restrictions allow finding numerous examples of systems that show perfect transfer but in geometries that are not implementable or are very difficult to implement in actual experimental settings. Relaxing the homogeneity of the interactions and inspired by the $XX$ qubit chains that show perfect transmission, we present a simple scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission. We present some simple examples and show how it is possible to generalize them for longer transmission lengths.

Related papers

• Permutationally Invariant Quantum State Tomography for Fermions [0.0]
  We develop a tomography protocol for permutation-invariant fermionic many-body states with U(1) particle-number symmetry.<n>We show that any such state is completely determined by the distribution of the total particle number.<n>More generally, the protocol reconstructs the permutation-symmetrized component of arbitrary U(1)-symmetric fermionic states.
  arXiv  Detail & Related papers  (2026-07-26T10:04:25Z)
• Distinguishing synthetic unravelings on quantum computers [0.16252563723817934]
  We introduce synthetic unravelings implemented as quantum circuits acting on one and two qubits.<n>We show that the variance across trajectories and the ensemble-averaged von Neumann entropy distinguish the unravelings in both theory and experiment.<n>Our results provide an accessible demonstration that quantum trajectories encode information about measurement backaction beyond what is fixed by the unconditional dynamics.
  arXiv  Detail & Related papers  (2026-01-27T18:56:38Z)
• Conditional Distribution Quantization in Machine Learning [83.54039134248231]
  Conditional expectation mathbbE(Y mid X) often fails to capture the complexity of multimodal conditional distributions mathcalL(Y mid X)<n>We propose using n-point conditional quantizations--functional mappings of X that are learnable via gradient descent--to approximate mathcalL(Y mid X)
  arXiv  Detail & Related papers  (2025-02-11T00:28:24Z)
• Perfect, Pretty Good and Optimized Quantum State Transfer in Transmon qubit chains [44.99833362998488]
  We study how changing the interaction strength between the chain qubits allows us to obtain perfect or pretty good state transfer.<n>For particular values of the interactions between the qubits, transmon chains are equivalent to generalized SSH chains.<n>We show that, in many cases, asking for fast transfer times results in chains with dimerized interactions that do not have topological states.
  arXiv  Detail & Related papers  (2025-01-17T22:16:41Z)
• Quantum state transfer performance of Heisenberg spin chains with site-dependent interactions designed using a generic genetic algorithm [0.0]
  We study the design of Heisenberg spin chains using a genetic algorithm. We obtain Hamiltonians with exchange coefficients varying smoothly along the chain length. Our results show that the smoothed Hamiltonians have the same, or less, transfer ability as the rough ones, and both kinds show similar robustness against static disorder.
  arXiv  Detail & Related papers  (2024-03-23T18:47:49Z)
• Transolver: A Fast Transformer Solver for PDEs on General Geometries [66.82060415622871]
  We present Transolver, which learns intrinsic physical states hidden behind discretized geometries. By calculating attention to physics-aware tokens encoded from slices, Transovler can effectively capture intricate physical correlations. Transolver achieves consistent state-of-the-art with 22% relative gain across six standard benchmarks and also excels in large-scale industrial simulations.
  arXiv  Detail & Related papers  (2024-02-04T06:37:38Z)
• Exact solution of a family of staggered Heisenberg chains with conclusive pretty good quantum state transfer [68.8204255655161]
  We work out the exact solutions in the one-excitation subspace. We present numerical evidence that pretty good transmission is achieved by chains whose length is not a power of two.
  arXiv  Detail & Related papers  (2022-06-28T18:31:09Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Arbitrary entangled state transfer via a topological qubit chain [5.581919120140629]
  We show that an arbitrary entangled state can be encoded in the corresponding edge states, and then adiabatically transferred from one end to the other of the chain. Our approach is robust against both the qubit-qubit coupling disorder and the evolution time disorder. For the concreteness of discussions, we assume that such a chain is constructed by an experimentally feasible superconducting qubit system.
  arXiv  Detail & Related papers  (2021-11-10T07:57:27Z)
• Pretty good quantum state transfer on isotropic and anisotropic Heisenberg spin chains with tailored site dependent exchange couplings [68.8204255655161]
  We consider chains with isotropic and anisotropic Heisenberg Hamiltonian with up to 100 spins. We consider short transferred times, in particular shorter than those achievable with known time-dependent control schemes.
  arXiv  Detail & Related papers  (2021-01-08T19:32:10Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Perfect State Transfer on Oriented Graphs [0.0]
  We study the phenomena, unique to oriented graphs, of multiple state transfer. We give a characterization of multiple state transfer, and a new example of a graph where it occurs.
  arXiv  Detail & Related papers  (2020-02-11T20:34:54Z)

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.