Variational quantum algorithms are among the most prominent methods in quantum computing, with applications in quantum machine learning, quantum simulation, and related fields. However, as the number of qubits grows, these algorithms often encounter the barren-plateau phenomenon, which severely limits their scalability. In this work, we introduce a novel parameter-initialization strategy based on Gaussian mixture models. We rigorously prove that for a hardware-efficient ansatz initialized in the state, our scheme avoids barren plateaus regardless of circuit depth, qubit count, or choice of cost function. Specifically, the lower bound on the initial gradient norm provided by our method remains independent of the number of qubits Building on this foundation, we validate our theoretical results through numerical experiments, including variational ground-state searches for Hamiltonians, to demonstrate the practical effectiveness of our approach. Our findings highlight the critical role of Gaussian mixture model-based initialization in enhancing the trainability of quantum circuits and offer valuable guidance for future theoretical and experimental advances in quantum machine learning.
Generation of entangled state is of paramount importance both from quantum theoretical foundation and technology applications. Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. However, perfect Bell measurements for qudits, the key to entanglement swapping, have been proven impossible to achieve by using only linear elements and particle detectors. To avoid this bottleneck, we propose a scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins. Then we conduct experimental realization of Bell state and three-qubit GHZ state between several designate parties on IBM quantum platform and the result has high fidelity by performing quantum tomography. In the end, we give a practical application of our scheme in multiparty quantum secret sharing.
We mainly study exceptional configuration for coined quantum walk search. For searching on a two-dimensional grid by AKR algorithm, we find some new classes of exceptional configurations that cannot be found by the AKR algorithm effectively and the known diagonal configuration can be regarded as its special case. Meanwhile, we give two modified quantum walk models that can improve the success probability in the exceptional configurations by numerical simulation. Furthermore, we introduce the concept of generalized exceptional configuration and consider search by quantum walk on a cycle with Grover coin. We find that the most common coin combination model (G, −), where G is a Grover diffusion transformation, is a generalized exceptional configuration when just searching one marked vertex on the cycle. In the end, we find generalized exceptional configuration has a different evolution of quantum coherence from exceptional configuration. These extend largely the range of exceptional configuration of quantum walk search in some sense.
24 December 2019 in Quantum Science and Technology
Quantum state transfer is an important task for scalable quantum complex networks. By selecting quantum walks with two coins as the basic model and two coin spaces as the communication carriers, we successfully implement some perfect state transfer tasks on various graphs (Shang et al 2019 Europhys. Lett.124 60009). Here, we provide the first experimental realization of this scheme by IBM Quantum Experience platform. Especially, we demonstrate the transfer of Bell state, GHZ state and W state on complete graph through this quantum apparatus. Furthermore, we notice that our protocols have high fidelity by performing quantum state tomography.
The matrix product state has been demonstrated to be able to explore the most relevant portion of the exponentially large quantum Hilbert space and find accurate solutions for one-dimensional interacting quantum many-body systems. Inspired by this success, here we propose a clustering algorithm based on the matrix product state, which first maps the classical data into quantum states represented as matrix product states, and then minimizes the loss function using a variational matrix product states algorithm in the enlarged space. We demonstrate this algorithm by applying it to several commonly used machine learning data sets, showing that this algorithm could reach higher learning precision and that it is less likely to be trapped in local minima compared to the standard K-means algorithm. We also show that this algorithm can achieve state-of-the-art learning precision on popular computer vision data sets when used in combination with better initialization schemes.