Physically motivated decompositions of single qutrit gates

• URL: http://arxiv.org/abs/2506.17797v1
• Date: Sat, 21 Jun 2025 19:40:21 GMT
• Title: Physically motivated decompositions of single qutrit gates
• Authors: Aryan Iliat, Mark Byrd, Sahel Ashhab, LianAo Wu,
• Abstract summary: Many parameterizations of unitary 3 * 3 matrices (U(3)) exist.<n>One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix.<n>This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take advantage of the additional levels, a parameterization of unitary transformations in terms of experimentally realizable operations is needed. Many parameterizations of unitary 3 * 3 matrices (U(3)) exist. One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix. This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses. This decomposition is numerically confirmed to allow the parameterization of any element in U(3). It is shown that a simple setting of parameter ranges of parameters can easily lead to an over-parameterization, in the sense that several different sets of values for the parameters produce the same element in U(3). This fact is demonstrated using the Walsh-Hadamard (WH) matrix as an example, which is also a special qutrit gate of practical interest. The different decompositions are shown to be related, and the relationships between them are presented using general methods. The shortest path needed for the implementation of a qutrit gate is found. Other parameterizations obtained by other analytic means, which can be advantageous for various reasons, are also discussed.

Related papers

• Superposed Parameterised Quantum Circuits [0.0]
  We introduce superposed parameterised quantum circuits to overcome limitations of existing approaches.<n>A superposed parameterised quantum circuit embeds an exponential number of parameterised sub-models in a single circuit.<n>We show how multiple parameter sets are trained in parallel while non-linear transformations broaden power beyond conventional quantum kernels.
  arXiv  Detail & Related papers  (2025-06-10T12:44:11Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  Conditional measurement is involved to avoid small success probability in ancilla measurement.<n>The objective function for the algorithm can be obtained probabilistically via measurement of the state of a one-qubit subsystem.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.<n>It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.<n>The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Phase shift rule with the optimal parameter selection [0.0]
  We provide insights about the optimal design of a parameter shift rule, tailored to various sorts of spectral information. The proposed method lets derivatives be calculated for any system, regardless of how close the eigenvalues are to each other.
  arXiv  Detail & Related papers  (2023-09-14T12:20:28Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
  We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry. FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function. We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
  arXiv  Detail & Related papers  (2022-05-26T07:44:54Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Generalized quantum circuit differentiation rules [23.87373187143897]
  Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators.
  arXiv  Detail & Related papers  (2021-08-03T00:29:45Z)
• General parameter-shift rules for quantum gradients [0.03823356975862005]
  Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. We show that a general parameter-shift rule can reduce the number of circuit evaluations significantly. Our approach additionally reproduces reconstructions of the evaluated function up to a chosen order, leading to known generalizations of the Rotosolve algorithm.
  arXiv  Detail & Related papers  (2021-07-26T18:00:02Z)
• Intrinsic Sensitivity Limits for Multiparameter Quantum Metrology [0.0]
  The quantum Cram'er-Rao bound provides the ultimate precision in parameter estimation. We show that, if the information is encoded in a unitary transformation, we can naturally choose the weight matrix. This ensures an intrinsic bound that is independent of the choice of parametrization.
  arXiv  Detail & Related papers  (2021-05-10T18:00:03Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)

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.