Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. We believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap matrices. The output from the quantum part of the algorithm is utilized as input for the classical computer. The classical part of the algorithm is a quadratically constrained quadratic program with a single quadratic equality constraint. Unlike the variational quantum eigensolver algorithm, our algorithm does not have any classical-quantum feedback loop. Using con…
The capacity for solving eigenstates with a quantum computer is key for ultimately simulating physical systems. Here we propose inverse iteration quantum eigensolvers, which exploit the power of quantum computing for the classical inverse power iteration method. A key ingredient is constructing an inverse Hamiltonian as a linear combination of coherent Hamiltonian evolution. We first consider a continuous-variable quantum mode (qumode) for realizing such a linear combination as an integral, with weights being encoded into a qumode resource state. We demonstrate the quantum algorithm with numer…
We present a hybrid classical-quantum algorithm to solve optimization problems in current quantum computers, whose basic idea is to assist variational quantum eigensolvers (VQE) with adiabatic change of the Hamiltonian. The rational for this new algorithm is to circumvent the problem of facing very small gradients in the classical optimization piece of a VQE, while being able to run in current hardware efficient devices. A discrete concatenation of VQEs adapted to interpolating Hamiltonians provides a method to keep the quantum state always close to a path faithfully directed to find the final…
The task of estimating the ground state of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorial optimization. We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian that builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers. Our algorithm systematically constructs the Ansatz using any given choice of the initial state and the unitaries describing the Hamiltonian. The only task of the quantum computer is to measure overlaps and no f…
In this paper, we calculate the entanglement-assisted classical information capacity of amplitude damping channel and compare it with the particular mutual information which is considered as the entanglement-assisted classical information capacity of this channel in Ref. 6. It is shown that the difference between them is very small. In addition, we point out that using partial symmetry and concavity of mutual information derived from dense coding scheme one can simplify the calculation of entanglement-assisted classical information capacities for non-unitary-covariant quantum noisy channels.
To obtain estimates of electronic energies, the Variational Quantum Eigensolver (VQE) technique performs separate measurements for multiple parts of the system Hamiltonian. Current quantum hardware is restricted to projective single-qubit measurements, and thus, only parts of the Hamiltonian which form mutually qubit-wise commuting groups can be measured simultaneously. The number of such groups in the electronic structure Hamiltonians grows as $N^4$, where $N$ is the number of qubits, and thus puts serious restrictions on the size of the systems that can be studied. Using a partitioning of th…
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this paper, We study quantum communication channels with correlated noise and derive a general expression for the mutual information of quantum channel, for the product, maximally entangled state coding and entanglement-assisted systems with correlated noise in the Pauli quantum channels. Hence, we suggest more efficient coding in the entanglement-assisted systems for the transmission of classica…
Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers
The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenvalues and eigenvectors of a given Hamiltonian on noisy intermediate-scale quantum (NISQ) devices. A particular application is to obtain ground or excited states of molecules. The practical realization is currently limited by the complexity of quantum circuits. Here we present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed …
We derive the general formula for the capacity of a noiseless quantum channel assisted by an arbitrary amount of noisy entanglement. In this capacity formula, the ratio of the quantum mutual information and the von Neumann entropy of the sender's share of the noisy entanglement plays the role of mutual information in the completely classical case. A consequence of our results is that bound entangled states cannot increase the capacity of a noiseless quantum channel.
The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms of the quantum mutual information and does not increase in the presence of a noiseless quantum feedback channel from receiver to sender. In this work, we investigate second-order asymptotics of the entanglement-assisted classical communication task. That is, we consider how quickly the rates of entanglement-assisted codes converge to the entanglement-assisted…
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply t…
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.
We study possible realizations of generalized quantum measurements on measurement-assisted programmable quantum processors. We focus our attention on the realization of von Neumann measurements and informationally complete POVMs. It is known that two unitary transformations implementable by the same programmable processor require mutually {\it orthogonal} states. It turns out that the situation with von Neumann measurements is different. Specifically, in order to realize two such measurements one does not have to use orthogonal program states. On the other hand, the number of the implementable…
We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The decoding set and the malicious set can either be disjoint or can have a finite intersection. For simplicity, we say that a single party Bob has access to the decoding set and another party Eve has access to the malicious set, and both Eve and Bob have access to the pre-shared entanglement with Alice. The goal of the task is for Alice to communicate classical inf…
It is easy to show coincidence of the entanglement-assisted classical capacity and the Holevo capacity for any c-q channel between finite dimensional quantum systems. In this paper we prove the converse assertion: coincidence of the above-mentioned capacities of a quantum channel implies that the $χ$-essential part of this channel is a c-q channel (the $χ$-essential part is a restriction of a channel obtained by discarding all input states useless for transmission of classical information). The above observations are generalized to infinite dimensional quantum channels with linear constraints …
We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using different classes of codes. First, we show that the minimum error of simulation and the one-shot quantum simulation cost under no-signalling assisted codes are given by semidefinite programs. Second, we introduce the channel's smooth max-information, which can be seen as a one-shot generalization of the mutual information of a quantum channel. We provide an exact operational interpretation of the channel's smooth max-information as the one-shot quantum simulatio…
We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. Remarkably, we find an interesting phenomenon that, in some situations, incomparable pairs ${| ψ> ,| ϕ> \} $ and ${| χ> ,| χ^{\prime}> \} $ can assist each other mutually so as to realize the transformation $| ψ> | χ> \to| ϕ> | χ^{\prime}>$. We also design an efficient algorithm to detect whethe…
Although it is widely accepted that classical information cannot travel faster than the speed of light in vacuum, the behavior of quantum correlations and quantum information propagating through actively-pumped fast-light media has not been studied in detail. To investigate this behavior, we send one half of an entangled state of light through a gain-assisted fast-light medium and detect the remaining quantum correlations. We show that the quantum correlations can be advanced by a small fraction of the correlation time while the entanglement is preserved even in the presence of noise added by …
A Maxwell demon can reduce the entropy of a quantum system by performing measurements on its environment. The nonsignaling theorem prevents the demon from affecting the average state of the system. We study the preparations of quantum correlations from a system qubit and an auxiliary qubit, assisted by a demon who obtains information of the system qubit from measurements on its environment. The demon can affect the postmeasured states of system by choosing different measurements, which establishes the relationships between quantum steering and other correlations in the thermodynamic framework.…
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.
The sequential quantum random access code (QRAC) allows two or more decoders to obtain a desired message with higher success probability than the best classical bounds by appropriately modulating the measurement sharpness. Here, we propose an entanglement-assisted sequential QRAC protocol which can enable device-independent tasks. By relaxing the equal sharpness and mutually unbiased measurement limits, we widen the sharpness modulation region from a one-dimensional interval to a two-dimensional triangle. Then, we demonstrate our scheme experimentally and get more than 27 standard deviations a…
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward, back, or two-way classical communication and compare these to the corresponding communication capacities. With forward assistance or no assistance, we find that they are equal. We establish the mutual information of the channel as an upper bound on the two-way assisted randomness distribution capacity. This implies that all of the capacities are equal for cla…
We investigated the super quantum discord based on weak measurements. The super quantum discord is an extension of the standard quantum discord defined by projective measurements and also describes the quantumness of correlations. We provide some equivalent conditions for zero super quantum discord by using quantum discord, classical correlation and mutual information. In particular, we find that the super quantum discord is zero only for product states, which have zero mutual information. This result suggests that non-zero correlations can always be detected using the quantum correlation with…
The uncertainty principle determines the distinction between the classical and quantum worlds. This principle states that it is not possible to measure two incompatible observables with the desired accuracy simultaneously. In quantum information theory, Shannon entropy has been used as an appropriate measure to express the uncertainty relation. According to the applications of entropic uncertainty relation, studying and trying to improve the bound of this relation is of great importance. Uncertainty bound can be altered by considering an extra quantum system as the quantum memory $B$ which is …
Simulating the dynamics of many-body quantum systems is believed to be one of the first fields that quantum computers can show a quantum advantage over classical computers. Noisy intermediate-scale quantum (NISQ) algorithms aim at effectively using the currently available quantum hardware. For quantum simulation, various types of NISQ algorithms have been proposed with individual advantages as well as challenges. In this work, we propose a new algorithm, truncated Taylor quantum simulator (TTQS), that shares the advantages of existing algorithms and alleviates some of the shortcomings. Our alg…
Reinforcement Learning Assisted Quantum Simulation of Many-Body Excited States and Real-Time Dynamics
School of Optical Information and Energy Engineering, Wuhan Institute of Technology（武汉工程大学光电信息与能源工程学院）；Zhejiang Laboratory（浙江实验室）；IQM Quantum Computers（IQM量子计算机）
The ground state cooling of a mechanical oscillator in an optomechanical cavity containing an ensemble of identical two-level ground-state atoms is studied in the highly unresolved-sideband regime. The system exhibits electromagnetically-induced transparency-like quantum interference effect. The mutual interaction with the cavity optical field gives rise to an indirect coupling between the atomic and mechanical modes. In presence of this interaction, the noise spectrum gets modified and leads to asymmetric cooling and heating rates. Using the quantum master equation, time evolution of the aver…
Variational quantum eigensolver~(VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its applications to many problems may involve a group of Hamiltonians, e.g., Hamiltonian of a molecule is a function of nuclear configurations. In this paper, we incorporate derivatives of Hamiltonian into VQE and develop some hybrid quantum-classical algorithms, which explores both Hamiltonian and wavefunction spaces for optimization. Aiming for solving quantum chemistry problems more efficiently, we first propose mutual gradient descent algorithm …
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this Paper, we study quantum-communication channels in $d$-dimensional systems and derive the mutual information of the quantum channels for maximally entangled states and product states coding with correlated noise. Then, we compare fidelity between these states. Our results show that there exists a certain fidelity memory threshold which depends on the dimension of the Hilbert space $(d)$ and t…
Quantum conditional mutual information and channel capacity
Institute of Theoretical Physics, Chinese Academy of Sciences（中国科学院理论物理研究所）；School of Physical Sciences, University of Chinese Academy of Sciences（中国科学院大学物理科学学院）
Several relations between the Holevo capacity and the entanglement-assisted classical capacity of a quantum channel are proved, necessary and sufficient conditions for their coincidence are obtained. In particular, it is shown that these capacities coincide if (correspondingly, only if) the channel (correspondingly, the $χ$--essential part of the channel) belongs to the class of classical-quantum channels (the $χ$-essential part is a restriction of a channel obtained by discarding all states useless for transmission of classical information). The obtained conditions and their corollaries are g…
Uncertainty principle is a striking and fundamental feature in quantum mechanics distinguishing from classical mechanics. It offers an important lower bound to predict outcomes of two arbitrary incompatible observables measured on a particle. In quantum information theory, this uncertainty principle is popularly formulized in terms of entropy. Here, we present an improvement of tripartite quantum-memory-assisted entropic uncertainty relation. The uncertainty's lower bound is derived by considering mutual information and Holevo quantity. It shows that the bound derived by this method will be ti…
The Variational Quantum Eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers. However, the circuit depth is expected to grow significantly with problem size. Increased depth can both degrade the accuracy of the results and reduce trainability. In this work, we propose a novel approach to reduce ansatz circuit depth. Our approach, called PermVQE, adds an additional optimization loop to VQE that permutes qubits in order to solve for the qubit Hamiltonian that minimizes long-range correlations in the ground state…
Recent developments have exposed close connections between quantum information and holography. In this paper, we explore the geometrical interpretations of the recently introduced $Q$-correlation and $R$-correlation, $E_Q$ and $E_R$. We find that $E_Q$ admits a natural geometric interpretation via the surface-state correspondence: it is a minimal mutual information between a surface region $A$ and a cross-section of $A$'s entanglement wedge with $B$. We note a strict trade-off between this minimal mutual information and the symmetric side-channel assisted distillable entanglement from the envi…
In the near future, material and drug design may be aided by quantum computer assisted simulations. These have the potential to target chemical systems intractable by the most powerful classical computers. However, the resources offered by contemporary quantum computers are still limited, restricting the chemical simulations to very simple molecules. In order to rapidly scale up to more interesting molecular systems, we propose the embedding of the quantum electronic structure calculation into a classically computed environment obtained at the Hartree-Fock (HF) or Density Functional Theory (DF…
