Coherence migration in high-dimensional bipartite systems

The conservation law for first-order coherence and mutual correlation of a bipartite qubit state is first proposed by Svozilík et al. [Phys. Rev. Lett. 115, 220501 (2015)], and their theories laid the foundation for the study of coherence migration under unitary transformations. In this paper, we generalize the framework of first-order coherence and mutual correlation to an arbitrary $(m \otimes n)$-dimensional bipartite composite state by introducing an extended Bloch decomposition form of the state. We also generalize two kinds of unitary operators in high-dimensional systems, which can bring about coherence migration and help to obtain the maximum or minimum first-order coherence. Meanwhile, coherence migration in open quantum systems are investigated. We take depolarizing channels as examples and establish that the reduced first-order coherence of the principal system over time is completely transformed into mutual correlation of the $(2 \otimes 4)$-dimensional system-environment bipartite composite state. It is expected that our results may provide a valuable idea or method for controlling the quantum resource such as coherence and quantum correlations.

How smooth is quantum complexity?

The “quantum complexity” of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical computational complexity, it has since been argued to hold a fundamental significance in its own right, as a physical quantity analogous to the thermodynamic entropy. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators. One striking feature of these functions is that they can exhibit non-smooth and even fractal behaviour. We use ideas from Diophantine approximation theory and sub-Riemannian geometry to rigorously quantify this lack of smoothness. Implications for the physical meaning of quantum complexity are discussed.

Fast tensor disentangling algorithm

Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.

Solving Dirac oscillator in commutative and noncommutative planes by supersymmetry structures

Based on the supersymmetry structures, we propose to solve the model of a charged Dirac oscillator interacting with a uniform perpendicular magnetic field on both commutative and noncommutative planes in a unified way by employing unitary transformations. The unitary operators are constructed out of the generators of the supersymmetry structures of the model.

Variational preparation of finite-temperature states on a quantum computer

The preparation of thermal equilibrium states is important for the simulation of condensed matter and cosmology systems using a quantum computer. We present a method to prepare such mixed states with unitary operators and demonstrate this technique experimentally using a gate-based quantum processor. Our method targets the generation of thermofield double states using a hybrid quantum-classical variational approach motivated by quantum-approximate optimization algorithms, without prior calculation of optimal variational parameters by numerical simulation. The fidelity of generated states to the thermal-equilibrium state smoothly varies from 99 to 75% between infinite and near-zero simulated temperature, in quantitative agreement with numerical simulations of the noisy quantum processor with error parameters drawn from experiment.

Dynamical Invariant and Exact Mechanical Analyses for the Caldirola–Kanai Model of Dissipative Three Coupled Oscillators

We study the dynamical invariant for dissipative three coupled oscillators mainly from the quantum mechanical point of view. It is known that there are many advantages of the invariant quantity in elucidating mechanical properties of the system. We use such a property of the invariant operator in quantizing the system in this work. To this end, we first transform the invariant operator to a simple one by using a unitary operator in order that we can easily manage it. The invariant operator is further simplified through its diagonalization via three-dimensional rotations parameterized by three Euler angles. The coupling terms in the quantum invariant are eventually eliminated thanks to such a diagonalization. As a consequence, transformed quantum invariant is represented in terms of three independent simple harmonic oscillators which have unit masses. Starting from the wave functions in the transformed system, we have derived the full wave functions in the original system with the help of the unitary operators.

Entanglement concentration for six-particle cluster states

Multi-particle cluster states play a significant role in quantum information processing. However, due to the inevitable interaction with the environment in the transmission process, the fidelity of entanglement decreases. To distill the perfect cluster states, we present two schemes for arbitrary six-particle cluster states. POVM local unitary operators that are obtained by solving the equation according to the properties of cluster states are used in the first protocol. The second protocol is based on cross-Kerr nonlinearity which is exploited to check parity between original qubit with ancillary single qubit and it can achieve a higher probability of success through iteration. Furthermore, we can generalize the first method to concentrate entanglement on even number of particles. Our protocol will be useful in practical applications.

Understanding mathematics of Grover’s algorithm

We analyze the mathematical structure of the classical Grover’s algorithm and put it within the framework of linear algebra over the complex numbers. We also generalize it in the sense, that we are seeking not the one ‘chosen’ element (sometimes called a ‘solution’) of the dataset, but a set of m such ‘chosen’ elements (out of $$n>m)$$ n > m ) . Besides, we do not assume that the so-called initial superposition is uniform. We assume also that we have at our disposal an oracle that ‘marks,’ by a suitable phase change $$\varphi $$ φ , all these ‘chosen’ elements. In the first part of the paper, we construct a unique unitary operator that selects all ‘chosen’ elements in one step. The constructed operator is uniquely defined by the numbers $$\varphi $$ φ and $$\alpha $$ α which is a certain function of the coefficients of the initial superposition. Moreover, it is in the form of a composition of two so-called reflections. The result is purely theoretical since the phase change required to reach this heavily depends on $$\alpha $$ α . In the second part, we construct unitary operators having a form of composition of two or more reflections (generalizing the constructed operator) given the set of orthogonal versors. We find properties of these operations, in particular, their compositions. Further, by considering a fixed, ‘convenient’ phase change $$\varphi ,$$ φ , and by sequentially applying the so-constructed operator, we find the number of steps to find these ‘chosen’ elements with great probability. We apply this knowledge to study the generalizations of Grover’s algorithm ($$m=1,\phi =\pi $$ m = 1 , ϕ = π ), which are of the form, the found previously, unitary operators.