This work considers various families of quantum control landscapes (i.e. objective functions for optimal control) for obtaining target unitary transformations as the general solution of the controlled Schrödinger equation. We examine the critical point structure of the kinematic landscapes J_F (U) = ||(U-W)A||^2 and J_P (U) = ||A||^4 - |Tr(AA'W'U)|^2 defined on the unitary group U(H) of a finite-dimensional Hilbert space H. The parameter operator A in B(H) is allowed to be completely arbitrary, yielding an objective function that measures the difference in the actions of U and the target W on a subspace of state space, namely the column space of A. The analysis of this function includes a description of the structure of the critical sets of these kinematic landscapes and characterization of the critical points as maxima, minima, and saddles. In addition, we consider the question of whether these landscapes are Morse-Bott functions on U(H). Landscapes based on the intrinsic (geodesic) distance on U(H) and the projective unitary group PU(H) are also considered. These results are then used to deduce properties of the critical set of the corresponding dynamical landscapes.
The recent quantum information boom has effected a resurgence of interest in unitary coupled cluster (UCC) theory. Our group's interest in local energy landscapes of unitary ansätze prompted us to investigate the classical approach of truncating the Taylor series expansion (instead of a perturbative expansion) of UCCSD energy at second-order. This amounts to an approach where electron correlation energy is estimated by taking a single Newton-Raphson step from Hartree-Fock toward UCCSD. Such an approach has been explored previously, but the accuracy was not extensively studied. In this paper, w…
This work develops measures for quantifying the effects of field noise upon targeted unitary transformations. Robustness to noise is assessed in the framework of the quantum control landscape, which is the mapping from the control to the unitary transformation performance measure (quantum gate fidelity). Within that framework, a new geometric interpretation of stochastic noise effects naturally arises, where more robust optimal controls are associated with regions of small overlap between landscape curvature and the noise correlation function. Numerical simulations of this overlap in the conte…
In this paper, we study the local unitary classification for pairs (triples) of generalized Bell states, based on the local unitary equivalence of two sets. In detail, we firstly introduce some general unitary operators which give us more local unitary equivalent sets besides Clifford operators. And then we present two necessary conditions for local unitary equivalent sets which can be used to examine the local inequivalence. Following this approach, we completely classify all of pairs in $d\otimes d$ quantum system into $\prod_{j=1}^{n} (k_{j} + 1) $ LU-inequivalent pairs when the prime facto…
We develop the embedded gradient vector field method, introduced in [8] and [9], for the case of the special unitary group $\mathcal{SU}(N)$ regarded as a constraint submanifold of the unitary group $\mathcal{U}(N)$. The optimization problem associated to the trace fidelity cost function defined on $\mathcal{SU}(N)$ that appears in the context of $\mathcal{SU}(N)$ quantum control landscapes is completely solved using the embedded gradient vector field method. We prove that for $N\geq 5$, the landscape is not $\mathcal{SU}(N)$-trap free, there are always kinematic local extrema that are not glo…
We present a comprehensive analysis of the landscape for full quantum-quantum control associated with the expectation value of an arbitrary observable of one quantum system controlled by another quantum system. It is shown that such full quantum-quantum control landscapes are convex, and hence devoid of local suboptima and saddle points that may exist in landscapes for quantum systems controlled by time-dependent classical fields. There is no controllability requirement for the full quantum-quantum landscape to be trap-free, although the forms of Hamiltonians, the flexibility in choosing initi…
We define the entropic bounds, i.e minimal uncertainty for pairs of unitary testers in distinguishing between unitary transformations not unlike the well known entropic bounds for observables. We show that in the case of specific sets of testers which pairwise saturate the trivial zero bound, the testers are all equivalent in the sense their statistics are the same. On the other hand, when maximal bounds are saturated by such sets of testers, the unitary operators would form unitary bases which are mutually unbiased. This resembles very much the role of mutually unbiased bases in maximizing th…
At its core a $t$-design is a method for sampling from a set of unitaries in a way which mimics sampling randomly from the Haar measure on the unitary group, with applications across quantum information processing and physics. We construct new families of quantum circuits on $n$-qubits giving rise to $\varepsilon$-approximate unitary $t$-designs efficiently in $O(n^3t^{12})$ depth. These quantum circuits are based on a relaxation of technical requirements in previous constructions. In particular, the construction of circuits which give efficient approximate $t$-designs by Brandao, Harrow, and …
We prove that if any error channel has a Kraus decomposition that is simultaneously correctable and Hilbert-Schmidt (HS) complete, then the existence of Kraus sets with these properties guarantees the correctability of all quantum channels. As a proof of the existence of such Kraus sets, the $n$-level depolarization channel is shown to have a random-unitary (RU) decomposition that is both HS complete and correctable due its RU nature, thereby proving that all quantum channels are correctable. As an application, conditions for universal error-correction operations are presented.
We address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness essentially coincides with the question of the most distinguishable element, thus, providing an operational meaning for this concept. Unexpectedly, we discovered that for any interior point of the set of channels the optimal decomposition necessarily contains a unitary channel. In other words, for any given channel the best distinguishable one is some unitary c…
Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2 designs. We introduce a general method for analyzing such protocols and subsequently apply it to two subgroups, the group generated by controlled-NOT, Hadamard, and Pauli gates and that generated by only controlled-NOT and Pauli gates. In both cases the error probability can be estimated to within a factor of two or less where the factor can be arranged to b…
We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms which use the Unitary Coupled Cluster (UCC) ansatz, designed to reduce circuit depth and gate count. This is achieved by partitioning Pauli exponential terms into mutually commuting sets. These sets are then diagonalised using Clifford circuits and synthesised using the phase polynomial formalism. This strategy reduces cx depth by 75.4% on average, and by up to 89.9%, compared to naive synthesis for a variety of molecules, qubit encodings and basis sets.
Given a set of quantum gates and a target unitary operation, the most elementary task of quantum compiling is the identification of a sequence of the gates that approximates the target unitary to a determined precision $\varepsilon$. Solovay-Kitaev theorem provides an elegant solution which is based on the construction of successively tighter `nets' around the unity comprised by successively longer sequences of gates. The procedure for the construction of the nets, according to this theorem, requires accessibility to the inverse of the gates as well. In this work, we propose a method for const…
We cast observable measure of quantum coherence or asymmetry as a resource to control the quantum speed limit (QSL) for unitary evolutions. For non-unitary evolutions, QSL depends on that of the state of the system and environment together. We show that the product of the time bound and the coherence (asymmetry) or the quantum part of the uncertainty behaves in a geometric way under partial elimination and classical mixing of states. These relations give a new insight to the quantum speed limit. We also show that our bound is experimentally measurable and is tighter than various existing bound…
We study quantum information masking of arbitrary dimensional states. Given a set of fixed reducing pure states, we study the linear combinations of them, such that they all have the same marginal states with the given ones. We define the so called Hadamard set of quantum states whose Gram-Schmidt matrix can be diagonalized by Hadamard unitary matrices. We show that any Hadamard set can be deterministically masked by a unitary operation. We analyze the states which can be masked together with the given Hadamard set using the result about the linear combinations of fixed reducing states. Detail…
Deep connections between invariant theory and entanglement have been known for some time and been the object of intense study. This includes the study of local unitary equivalence of density operators as well as entanglement that can be observed in stochastic local operations assisted by classical communication (SLOCC). An important aspect of both of these areas is the computation of complete sets of invariants polynomials. For local unitary equivalence as well as $n$-qubit SLOCC invariants, complete descriptions of these invariants exist. However, these descriptions give infinite sets; of gre…
The control of quantum system dynamics is generally performed by seeking a suitable applied field. The physical objective as a functional of the field forms the quantum control landscape, whose topology, under certain conditions, has been shown to contain no critical point suboptimal traps, thereby enabling effective searches for fields that give the global maximum of the objective. This paper addresses the structure of the landscape as a complement to topological critical point features. Recent work showed that landscape structure is highly favorable for optimization of state-to-state transit…
Akin to the idea of complete sets of Mutually Unbiased Bases for prime dimensional Hilbert spaces, $\mathcal{H}_d$, we study its analogue for a $d$ dimensional subspace of $M (d,\mathbb{C})$, i.e. Mutually Unbiased Unitary Bases (MUUBs) comprising of unitary operators. We note an obvious isomorphism between the vector spaces and beyond that, we define a relevant monoid structure for $\mathcal{H}_d$ isomorphic to one for the subspace of $M (d,\mathbb{C})$. This provides us not only with the maximal number of such MUUBs, but also a recipe for its construction.
Geometric Analysis of Variational Quantum Eigensolver
Michigan Institute for Computational Discovery and Engineering, Department of Electrical Engineering and Computer Science and Department of Statistics, University of Michigan（密歇根大学计算发现与工程研究所、电气工程和计算机科学系以及统计学系）
We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU($n$), a naive brute-force search requires a computational complexity of $O(1/\varepsilon^{(n^2 - 1)})$ to achieve an approximation with error $\varepsilon$. In contrast, by using our method, the complexity can be reduced to $O(-n^2 \log\varepsilon/\varepsilon^{((n^2 - 1)/2)})$. This method requires almost no assumptions and can be applied to a variety of gate sets, including Clifford+$T$ and Clifford+$V$. Further, w…
A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets
Jiangsu Engineering Center of Network Monitoring（江苏省网络监控工程中心）；Nanjing University of Information Science and Technology（南京信息工程大学）；School of Computer and Software, Nanjing University of Information Science and Technology（南京信息工程大学计算机与软件学院）；School of Mathematics and Computing Science, Guilin University of Electronic Technology（桂林电子科技大学数学与计算科学学院）；College of Computer Science and Information Technology, Guangxi Normal University（广西师范大学计算机科学与信息工程学院）
Energy Landscape Plummeting in Variational Quantum Eigensolver: Subspace Optimization, Non-iterative Corrections and Generator-informed Initialization for Improved Quantum Efficiency
Twirling operations, which average a quantum state with respect to a unitary subgroup, have become a frequently-employed tool in quantum information processing. We investigate the efficient implementation of twirling operations with minimal resources, without necessitating the ability to perform all possible unitary operations on the quantum system of interest. We present a general algebraic method allowing us to choose a set of - typically very few - unitary operators which, when applied randomly and repeatedly, produce the given twirling operation exponentially quickly. The method is applied…
We introduce a notion of nuclear numerical range defined as the set of expectation values of a given operator $A$ among normalized pure states, which belong to the nucleus of an auxiliary operator $Z$. This notion proves to be applicable to investigate models of quantum noise with block-diagonal structure of the corresponding Kraus operators. The problem of constructing a suitable quantum error correction code for this model can be restated as a geometric problem of finding intersection points of certain sets in the complex plane. This technique, worked out in the case of two-qubit systems, ca…
