Reduction of unitary operators, quantum graphs and quantum channels

• URL: http://arxiv.org/abs/2407.19536v2
• Date: Wed, 11 Dec 2024 09:27:47 GMT
• Title: Reduction of unitary operators, quantum graphs and quantum channels
• Authors: L. L. Salcedo,
• Abstract summary: Given a unitary operator in a finite dimensional complex Hilbert space, its unitary reduction to a subspace is defined. The application to quantum graphs is discussed. The reduction of quantum channels is also defined.
• Score: 0.0
• License:
• Abstract: Given a unitary operator in a finite dimensional complex Hilbert space, its unitary reduction to a subspace is defined. The application to quantum graphs is discussed. It is shown how the reduction allows to generate the scattering matrices of new quantum graphs from assembling of simpler graphs. The reduction of quantum channels is also defined. The implementation of the quantum gates corresponding to the reduced unitary operator is investigated, although no explicit construction is presented. The situation is different for the reduction of quantum channels for which explicit implementations are given.

Related papers

• An explicit tensor notation for quantum computing [0.0]
  This paper introduces a formalism that aims to describe the intricacies of quantum computation. The focus is on providing a comprehensive representation of quantum states for multiple qubits and the quantum gates that manipulate them.
  arXiv  Detail & Related papers  (2024-09-16T17:21:17Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• On the construction of a quantum channel corresponding to non-commutative graph for a qubit interacting with quantum oscillator [0.0]
  We consider error correction based on the theory of non-commutative graphs. We construct a quantum channel generating the non-commutative graph as a linear envelope of the POVM. For this model the quantum anticlique which determines the error correcting subspace has an explicit expression.
  arXiv  Detail & Related papers  (2024-03-11T13:55:03Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• 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)
• Spectral bounds for the quantum chromatic number of quantum graphs [0.0]
  We obtain lower bounds for the classical and quantum number of a quantum graph using eigenvalues of the quantum adjacency matrix. We generalize all the spectral bounds given by Elphick and Wocjan to the quantum graph setting. Our results are achieved using techniques from linear algebra and a complete definition of quantum graph coloring.
  arXiv  Detail & Related papers  (2021-12-03T05:36:21Z)
• Stochastic emulation of quantum algorithms [0.0]
  We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm. We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
  arXiv  Detail & Related papers  (2021-09-16T07:54:31Z)
• Non-commutative graphs based on finite-infinite system couplings: quantum error correction for a qubit coupled to a coherent field [0.0]
  We study error correction in the case of a finite-dimensional quantum system coupled to an infinite dimensional system. We find the quantum anticlique, which is the projector on the error correcting subspace, and analyze it as a function of the frequencies of the qubit and the bosonic field.
  arXiv  Detail & Related papers  (2021-04-24T12:06:43Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.