Abstract In this work, we report a novel quantum state reconstruction process based on the disentanglement algorithm. We propose a sequential disentanglement scheme, which can transform an unknown quantum state into a product of computational zero states. The inverse evolution of the zero states reconstructs the quantum state up to an overall phase. By sequentially disentangling the qubits one by one, we reduce the required measurements with only individual qubit measurement and identify the transformation unitary efficiently. Variational quantum circuit and reinforcement learning methods are used for the quantum circuit design for continuous and discrete quantum gates implementation. Demonstrations with our proposal for the reconstruction of the random states are presented. Our method is universal and imposes no specific ansatz or constraint on the quantum state.
Abstract In this work, we report a novel quantum state reconstruction process based on the disentanglement algorithm. We propose a sequential disentanglement scheme, which can transform an unknown quantum state into a product of computational zero states. The inverse evolution of the zero states reconstructs the quantum state up to an overall phase. By sequentially disentangling the qubits one by one, we reduce the required measurements with only individual qubit measurement and identify the transformation unitary efficiently. Variational quantum circuit and reinforcement learning methods are used for the quantum circuit design for continuous and discrete quantum gates implementation. Demonstrations with our proposal for the reconstruction of the random states are presented. Our method is universal and imposes no specific ansatz or constraint on the quantum state.
Abstract Quantum state reconstruction is an important tool in quantum information science. Based on the idea of sequential disentanglement, we propose a quantum state reconstruction algorithm that reduces the number of parameters to be optimized. For transforming the arbitrary quantum state into a tensor product of 0 states in the computational basis, we give the conclusion that it is not necessary to apply a global unitary transformation in the optimization of sequential disentanglement. In detail, for disentangling arbitrary n-qubit pure state ψ into ψ ˜ 0 , we simply apply the quantum operator U to n − n − 1 2 qubits. This means that the number of parameters that need to be optimized has been further reduced, thereby saving quantum resources. Finally, numerical simulations verify the feasibility of the proposed algorithm.
Variational quantum algorithms have been a promising candidate to utilize near-term quantum devices to solve real-world problems. The powerfulness of variational quantum algorithms is ultimately determined by the expressiveness of the underlying quantum circuit ansatz for a given problem. In this work, we propose a sequentially generated circuit ansatz, which naturally adapts to 1D, 2D, 3D quantum many-body problems. Specifically, in 1D our ansatz can efficiently generate any matrix product states with a fixed bond dimension, while in 2D our ansatz generates the string-bond states. As applications, we demonstrate that our ansatz can be used to accurately reconstruct unknown pure and mixed quantum states which can be represented as matrix product states, and that our ansatz is more efficient compared to several alternatives in finding the ground states of some prototypical quantum many-body systems as well as quantum chemistry systems, in terms of the number of quantum gate operations.
Identifying phases of matter is a complicated process, especially in quantum theory, where the complexity of the ground state appears to rise exponentially with system size. Traditionally, physicists have been responsible for identifying suitable order parameters for the identification of the various phases. The entanglement of quantum many-body systems exhibits rich structures and can be determined over the phase diagram. The intriguing question of the relationship between entanglement and quantum phase transition has recently been addressed. As a method that works directly on the entanglement structure, disentanglement can provide factual information on the entanglement structure. In this work, we follow a radically different approach to identifying quantum phases: we utilize reinforcement learning (RL) approaches to develop an efficient variational quantum circuit that disentangles the ground-state of Ising spin chain systems. We show that the specified quantum circuit structure of the tested models correlates to a phase transition in the behaviour of the entanglement. We show a similar universal quantum circuit structure for ground states in the same phase to reduce entanglement entropy. This study sheds light on characterizing quantum phases with the types of entanglement structures of the ground states.
The quantum state generation problem is a major research goal of quantum control and quantum variational algorithms, which use iterative optimization methods to evolve the initial state to the target state. The Twin Delayed Deep Deterministic Policy (TD3) algorithm in reinforcement learning achieves high learning efficiency and better stability in continuous control tasks. Here, using the TD3, we propose a new quantum state preparation method that does not require case-by-case optimization, to find a suitable evolution path to obtain the desired state. Specifically, we input the initial state into the trained actor-network, which can output the parameters of the unitary gates step by step, thus gradually evolving the initial state to the fixed quantum state. According to the reversibility of the unitary transformation, we can obtain a sequence of unitary gates to evolve the fixed state to the desired state. To verify the effectiveness of the algorithm, we perform simulations for one-qubit, two-qubit, and four-qubit cases, and the results show that the trained actor-network can provide appropriate unitary transformations to obtain the fixed state.
Abstract The variational quantum algorithms are crucial for the application of NISQ computers. Such algorithms require short quantum circuits, which are more amenable to implementation on near-term hardware, and many such methods have been developed. One of particular interest is the so-called variational quantum state diagonalization method, which constitutes an important algorithmic subroutine and can be used directly to work with data encoded in quantum states. In particular, it can be applied to discern the features of quantum states, such as entanglement properties of a system, or in quantum machine learning algorithms. In this work, we tackle the problem of designing a very shallow quantum circuit, required in the quantum state diagonalization task, by utilizing reinforcement learning (RL). We use a novel encoding method for the RL-state, a dense reward function, and an ε-greedy policy to achieve this. We demonstrate that the circuits proposed by the RL methods are shallower than the standard variational quantum state diagonalization algorithm and thus can be used in situations where hardware capabilities limit the depth of quantum circuits. The methods we propose in the paper can be readily adapted to address a wide range of variational quantum algorithms.
Abstract Quantum compiling aims to construct a quantum circuitVby quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitaryU. It is a crucial stage for the running of quantum algorithms on noisy intermediate-scale quantum (NISQ) devices. However, the space for structure exploration of quantum circuit is enormous, resulting in the requirement of human expertise, hundreds of experimentations or modifications from existing quantum circuits. In this paper, we propose a variational quantum compiling (VQC) algorithm based on reinforcement learning, in order to automatically design the structure of quantum circuit for VQC with no human intervention. An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by doubleQ-learning withϵ-greedy exploration strategy and experience replay. At first, the agent randomly explores a number of quantum circuits with different structures, and then iteratively discovers structures with higher performance on the learning task. Simulation results show that the proposed method can make exact compilations with less quantum gates compared to previous VQC algorithms. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices, and enable quantum algorithms especially for complex algorithms to be executed within coherence time.