Related papers: Matrix realignment and partial transpose approach …
Partial transpose is an important operation for quantifying the entanglement, here we study the (partial) transpose of any single (two-mode) operators. Using the Fock-basis expansion, it is found that the transposed operator of an arbitrary…
In this note, we discuss dilation-theoretic matrix parametrizations of contractions and positive matrices. These parametrizations are then applied to some problems in quantum information theory. First we establish some properties of…
Shared entanglement allows, under certain conditions, the remote implementation of quantum operations. We revise and extend recent theoretical results on the remote control of quantum systems as well as experimental results on the remote…
We study manipulation of entanglement between two identical networks of quantum mechanical particles. Firstly, we reduce the problem of entanglement transfer to the problem of quantum state transfer. Then, we consider entanglement…
We investigate entanglement properties of a recently introduced class of macroscopic quantum superpositions in two-mode mixed states. One of the tools we use in order to infer the entanglement in this non-Gaussian class of states is the…
In this paper, we present a framework for modeling quantum recurrent neural networks (RNNs) and their enhanced version, long short-term memory (LSTM) networks using the core ideas presented by Linden et al. (2009), where the entangling and…
An analytically derived 'integral operator' approach is introduced to estimate the expectation value of a quantum operator for an evolving state weighted with an exponential function. This allows to compute quantities useful in Nuclear…
The possibility of using similarity transformations to alter dynamical entanglement growth in matrix-product-state simulations of quantum systems is explored. By appropriately choosing the similarity transformation, the entanglement growth…
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…
Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing and underpins numerous quantum algorithms. In this work, we introduce a novel algorithmic framework for quantum amplitude…
In this survey the possible approaches to the description of the evolution of states of quantum many-particle systems by means of the possible modifications of the density operator which kernel known as density matrix are considered. In…
We study operator entanglement of the quantum chaotic evolutions. This study shows that properties of the operator entanglement production are qualitatively similar to the properties reported in literature about the pure state entanglement…
Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary…
We introduce methods of characterizing entanglement, in which entanglement measures are enriched by the matrix representations of operators for observables. These observable operator matrix representations can enrich the partial trace over…
Entanglement is a fundamental feature of quantum mechanics, playing a crucial role in quantum information processing. However, classifying entangled states, particularly in the mixed-state regime, remains a challenging problem, especially…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
Building a scalable quantum computer requires developing appropriate models to understand and verify its complex quantum dynamics. We focus on superconducting quantum processors based on transmons for which full numerical simulations are…
Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…