Related papers: Decoupling with random diagonal unitaries
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
Phase unwrapping is a key problem in many coherent imaging systems, such as synthetic aperture radar (SAR) interferometry. A general formulation for redundant integration of finite differences for phase unwrapping (Costantini et al., 2010)…
Active protection of quantum states is an essential prerequisite for the implementation of quantum computing. Dynamical decoupling (DD) is a promising approach that applies sequences of control pulses to the system in order to reduce the…
Quantum dense coding plays an important role in quantum cryptography communication, and how to select a set of appropriate unitary operators to encode message is the primary work in the design of quantum communication protocols. Shukla et…
We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective…
We propose a general procedure for implementing dynamical decoupling without requiring arbitrarily strong, impulsive control actions. This is accomplished by designing continuous decoupling propagators according to Eulerian paths in the…
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…
Two recent developments in quantum control, concatenation and optimization of pulse intervals, are combined to yield a strategy to suppress unwanted couplings in quantum systems to high order. Longitudinal relaxation and transverse…
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple…
A longstanding challenge in the foundations of quantum mechanics is the verification of alternative collapse theories despite their mathematical similarity to decoherence. To this end, we suggest a novel method based on dynamical…
Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…
We compare the multipartite entangling and disentangling powers of unitary operators by assessing their ability to generate or eliminate genuine multipartite entanglement. Our findings reveal that while diagonal unitary operators can…
Quantum networking relies on entanglement distribution between distant nodes, typically realized by swapping procedures. However, entanglement swapping is a demanding task in practice, mainly because of limited effectiveness of entangled…
We here use our non-perturbative, cluster decomposable relativistic scattering formalism to calculate photon-spinor scattering, including the related particle-antiparticle annihilation amplitude. We start from a three-body system in which…
Dynamical decoupling is a central technique in quantum computing for actively suppressing decoherence and systematic imperfections through sequences of single-qubit operations. Conventional sequences typically aim to completely freeze…
Simulating quantum systems with their environments often requires non-unitary operations, and mapping these to quantum devices often involves expensive dilations or prohibitive measurement costs to achieve desired precisions. Building on…
Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
We consider $3d$ $\mathcal{N}\!=\!2$ gauge theories with fundamental matter plus a single field in a rank-$2$ representation. Using iteratively a process of "deconfinement" of the rank-$2$ field, we produce a sequence of Seiberg-dual quiver…
We consider a toy model of noise channels, given by a random mixture of unitary operations, for state transfer problems with continuous variables. Assuming that the path between the transmitter node and the receiver node can be intervened,…