A generalized universal quantum cloning machine is proposed which allows the input to be arbitrary states in symmetric subspace. And it reduces to the universal quantum cloning machine (UQCM) if the input are identical pure states. The generalized cloner is optimal in the sense we compare the input and output reduced density operators at a single qubit. The result for qubits is extended to arbitrary-dimensional states.
We derive a tight upper bound for the fidelity of a universal N to M qubit cloner, valid for any M \geq N, where the output of the cloner is required to be supported on the symmetric subspace. Our proof is based on the concatenation of two cloners and the connection between quantum cloning and quantum state estimation. We generalise the operation of a quantum cloner to mixed and/or entangled input qubits described by a density matrix supported on the symmetric subspace of the constituent qubits. We also extend the validity of optimal state estimation methods to inputs of this kind.
A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast (``bang-bang'', BB) pulses that create the conditions allowing for the existence of DFSs that support scalable, universal quantum computation. One such example is the creation of the conditions for collective decoherence, wherein all system particles are coupled in an identical manner to their environment. The BB pulses needed for this are generated using only the Heisenberg exchange interaction. In conjunction with previous results, this sho…
Leakage errors arise when the quantum state leaks out of some subspace of interest, for example, the two-level subspace of a multi-level system defining a computational `qubit' or the logical code space defined by some quantum error-correcting code or decoherence-free subspace. Leakage errors pose a distinct challenge to quantum control relative to the more well-studied decoherence errors and can be a limiting factor to achieving fault-tolerant quantum computation. Here we present scalable and robust randomized benchmarking protocols for quickly estimating the rates of both coherent and incohe…
We present an algorithm to compute Green's functions on quantum computers for interacting electron systems, which is a challenging task on conventional computers. It uses a continued fraction representation based on the Lanczos method, where the wave functions are expanded as linear combination of basis states within a quantum subspace. While on conventional computers the cost of the computation grows exponentially with system size, limiting the method to small systems, by representing the basis states on a quantum computer one may overcome this exponential scaling barrier. We propose a two-le…
Population leakage outside the qubit subspace presents a particularly harmful source of error that cannot be handled by standard error correction methods. Using a trapped $^{171}$Yb$+$ ion, we demonstrate an optical pumping scheme to suppress leakage errors in atomic hyperfine qubits. The selection rules and narrow linewidth of a quadrupole transition are used to selectively pump population out of leakage states and back into the qubit subspace. Each pumping cycle reduces the leakage population by a factor of $\sim3$, allowing for an exponential suppression in the number of cycles. We use inte…
There is currently a tremendous interest in developing practical applications of NISQ processors without the overhead required by full error correction. Quantum information processing is especially challenging within the gate model, as algorithms quickly lose fidelity as the problem size and circuit depth grow. This has lead to a number of non-gate-model approaches such as analog quantum simulation and quantum annealing. These approaches come with specific hardware requirements that are typically different than that of a universal gate-based quantum computer. We have previously proposed a non-…
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical means exists by which an unknown arbitrary quantum state can be reproduced or copied perfectly. Using the Deutsch approach, we have shown that the no-cloning theorem can be circumvented in the presence of closed timelike curves, allowing the perfect cloning of a quantum state chosen randomly from a finite alphabet of states. Further, we show that a universal …
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not possible to use memory-consuming techniques for current quantum devices having at most hundreds or at best thousands of physical qubits on their own. For specific problems, valid quantum states have a unique structure as in the case of Fock states and W-states where the Hamming weight is fixed, and the evolution takes place in a smaller subspace of the full Hilbe…
The Krylov subspace method is a standard approach to approximate quantum evolution, allowing to treat systems with large Hilbert spaces. Although its application is general, and suitable for many-body systems, estimation of the committed error is involved. This makes it difficult to automate its use. In this paper, we solve this problem by realizing that such error can be regarded as a Loschmidt echo in a tight-binding Hamiltonian. We show that the different time-regimes of the approximation can be understood using simple physical ideas. More importantly, we obtain computationally cheap error …
Efficient quantum compression for identically prepared states with arbitrary dimensio
School of Mathematics Science, Zhejiang University（浙江数学学院）；School of Mathematics and Statistics, Central South University（中南大学数学与统计学院）；Institute of Computational Mathematics and Information Technologies, Kazan Federal University（喀山联邦大学计算数学与信息技术研究所）
The successful application of Quantum Optimal Control (QOC) over the past decades unlocked the possibility of directing the dynamics of quantum systems. Nevertheless, solutions obtained from QOC algorithms are usually highly irregular, making them unsuitable for direct experimental implementation. In this paper, we propose a method to reshape those unattractive optimal controls. The approach is based on the fact that solutions to QOC problems are not isolated policies but constitute multidimensional submanifolds of control space. This was originally shown for finite-dimensional systems. Here, …
Highly excited eigenstates of quantum many-body systems are typically featureless thermal states. Some systems, however, possess a small number of special, low-entanglement eigenstates known as quantum scars. We introduce a quantum-inspired machine learning platform based on a Quantum Variational Autoencoder (QVAE) that detects families of scar states in spectra of many-body systems. Unlike a classical autoencoder, QVAE performs a parametrized unitary operation, allowing us to compress a single eigenstate into a smaller number of qubits. We demonstrate that the autoencoder trained on a scar st…
We propose an effective realization of the universal set of elementary quantum gates in solid state quantum computer based on macroscopic (or mesoscopic) resonance systems - multi-atomic coherent ensembles, squids or quantum dots in quantum electrodynamic cavity. We exploit an encoding of logical qubits by the pairs of the macroscopic two- or three-level atoms that is working in a Hilbert subspace of all states inherent to these atomic systems. In this subspace, logical single qubit gates are realized by the controlled reversible transfer of single atomic excitation in the pair via the exchang…
With the rapid developments in quantum hardware comes a push towards the first practical applications on these devices. While fully fault-tolerant quantum computers may still be years away, one may ask if there exist intermediate forms of error correction or mitigation that might enable practical applications before then. In this work, we consider the idea of post-processing error decoders using existing quantum codes, which are capable of mitigating errors on encoded logical qubits using classical post-processing with no complicated syndrome measurements or additional qubits beyond those used…
The quantum Zeno effect, in its original form, uses frequent projective measurements to freeze the evolution of a quantum system that is initially governed by a fixed Hamiltonian. We generalize this effect simultaneously in three directions by allowing open system dynamics, time-dependent evolution equations and general quantum operations in place of projective measurements. More precisely, we study Markovian master equations with bounded generators whose time dependence is Lipschitz continuous. Under a spectral gap condition on the quantum operation, we show how frequent measurements again fr…
