Ari Mizel, M. W. Mitchell, Marvin L. Cohen
We formulate a novel ground state quantum computation approach that requires no unitary evolution of qubits in time: the qubits are fixed in stationary states of the Hamiltonian. This formulation supplies a completely time-independent approach to realizing quantum computers. We give a concrete suggestion for a ground state quantum computer involving linked quantum dots.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Ground-state quantum computers mimic quantum mechanical time evolution within the amplitudes of a time-independent quantum state. We explore the principles that constrain this mimicking. A no-cloning argument is found to impose strong restrictions. It is shown, however, that there is flexibility that can be exploited using quantum teleportation methods to improve ground-state quantum computer design.
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem Hamiltonian via particular adiabatic passages, starting from an initialized ground state of a simple Hamiltonian. One disadvantage of AQC is the significant growth of necessary runtime, in particular when there are quantum phase transitions during the AQC passages. Here we propose a nondeterministic ground state cooling quantum computation model based on selecti…
We propose a new quantum computational way of obtaining a ground-state energy and expectation values of observables of interacting Hamiltonians. It is based on the combination of the adiabatic quantum evolution to project a ground state of a non-interacting Hamiltonian onto a ground state of an interacting Hamiltonian and the phase estimation algorithm to retrieve the ground-state energy. The expectation value of an observable for the ground state is obtained with the help of Hellmann-Feynman theorem. As an illustration of our method, we consider a displaced harmonic oscillator, a quartic anha…
We study design challenges associated with realizing a ground state quantum computer. In such a computer, the energy gap between the ground state and first excited state must be sufficiently large to prevent disruptive excitations. Here, an estimate is provided of this gap as a function of computer size. We then address the problem of detecting the output of a ground state quantum computer. It is shown that the exponential detection difficulties that appear to be present at first can be overcome in a straightforward manner by small design changes.
We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static in the sense that they contribute Hamiltonian 0 and hold as constants of the motion; only the wires are dynamic. Just as a spin 1/2 makes an ideal 1-bit memory element, a spin 1 makes an ideal 3-bit gate. Such gates cost no computation time: relaxing the wires alone solves the network. We compare computation time with that of an easier Boolean network where …
We develop a computation model for solving Boolean networks by implementing wires through quantum ground-mode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by three-dimensional (triplet) symmetries due to particle indistinguishability and are identically satisfied throughout computation being constants of the motion. The relaxation of the wires yields the network solutions. Such gates cost no computation time, which is comparable with that of an easier Boolean network where all the gate constraints implemented as constant…
We present the general structure of two-photon S matrix for a waveguide coupled to a local quantum system that supports multiple ground states. The presence of the multiple ground states results in a non-commutative aspect of the system with respect to the exchange of the orders of photons. Consequently, the two-photon S matrix significantly differs from the standard form as described by the cluster decomposition principle in the quantum field theory.
We have tested the experimental prerequisites for a Space-to-Ground quantum communication link between satellites and an optical ground station. The feasibility of our ideas is being assessed using the facilities of the ASI Matera Laser Ranging Observatory (MLRO). Specific emphasis is put on the necessary technological modifications of the existing infrastructure to achieve single photon reception from an orbiting satellite.
We optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical quantum critical point found in quenches of this model across its quantum critical point can be simulated. Our approach avoids finite-size scaling effects by using sequential quantum circuits inspired by infinite matrix product states. We provide efficient circuits and a variety of error mitigation strategies to implement, optimise and time-evolve these states.
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time sqrt(N). Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficientl…
Systems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum computation. This is an instance of quantum-statistical computation: some of the logical relations of the problem are satisfied identically in virtue of quantum statistics, which takes no time. We show heuristically that quantum-statistical ground-mode computation is substantially faster than pure ground-mode computation when the ground mode is reached by annealing.
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground s…
Using an NMR quantum computer, we experimentally simulate the quantum phase transition of a Heisenberg spin chain. The Hamiltonian is generated by a multiple pulse sequence, the nuclear spin system is prepared in its (pseudo-pure) ground state and the effective Hamiltonian varied in such a way that the Heisenberg chain is taken from a product state to an entangled state and finally to a different product state.
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be remarkably valuable, if only it were thermodynamically stable and experimentally accessible, by virtue of being the unique ground state of a physically reasonable Hamiltonian made of two-body, nearest neighbor interactions. We introduce such a state, composed of six-state particles on a hexagonal lattice, and describe a general method for analyzing its prop…
We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper bounds. Our routine can also be used to optimize certain design parameters for specific problem instances. Lastly, we propose and benchmark an improved quantum state preparation procedure. We find that it reduces the circuit T-depth by a factor as large as $10^6$ for intermediate-size lattices.
Quasiclassical solution of the three-dimensional Schredinger's equation is given. The existence of nonzero minimal angular momentum M_0 = \hbar /2 is shown, which corresponds to the quantum fluctuations of the angular momentum and contributes to the energy of the ground state.
Significant effort in applied quantum computing has been devoted to the problem of ground state energy estimation for molecules and materials. Yet, for many applications of practical value, additional properties of the ground state must be estimated. These include Green's functions used to compute electron transport in materials and the one-particle reduced density matrices used to compute electric dipoles of molecules. In this paper, we propose a quantum-classical hybrid algorithm to efficiently estimate such ground state properties with high accuracy using low-depth quantum circuits. We prov…
A method of storing and retrieving quantum states of radiation fields using the ground-state coherences is discussed. We demonstrate the generation of multiparticle entangled states starting from atoms prepared in a coherent state. Use is made of the j=-1/2 to +1/2 atomic transition and its interaction with a far-detuned elliptically polarized field.
Under suitable assumptions, the quantum phase estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground state energy. However, QPE requires a large number of ancilla qubits and large circuit depth, as well as the ability to perform inverse quantum Fourier transform, making it expensive to implement on an early fault-tolerant quantum computer. We propose an alternative method to estimate the ground state energy of a Hamiltonian with Heisenberg-limited precision scaling, which employs a simple quantum circuit with one ancilla qubit, and a classic…
The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field by Kadowaki and Nishimori close to two decades ago. Recent technological breakthroughs in the field, which have led to the manufacture of experimental prototypes of quantum annealing optimizers with sizes approaching the practical regime, have reignited this discussion. However, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted goal. Here, we examine the power of quantum annealers to provide a different …
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an hydrogen molecule and calculate its ground-state energy. We utilize the NMR interferometry method to measure the phase shift and iterate the process to get a high precision. Finally we get 17 precise bits of the energy value, and we also analyze the source of the error in the simulation.
Ground-state reachability for variational quantum eigensolvers: a Rydberg-atom case study
本研究通过分析固有对称性，探讨了变分量子特征求解器（VQE）的基态可达性条件，并在里德堡原子量子模拟器上验证了其预测基态可达性的可靠性，提出了克服对称性限制的实用方法。
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state pr…
Polaritonic Ultrastrong Coupling: Quantum Entanglement in Ground State
本文通过对角化极化激元哈密顿量并利用基态的高斯性质，推导纠缠熵与对数负性参数的解析表达式，证明超强耦合区基态存在显著量子纠缠。
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an interacting Green's function for use in condensed matter, particle physics, and other areas. The wavefunction does not need to be re-prepared at each iteration. The quantum algorithm represents an exponential reduction in memory over known classical methods. An extension of the method to determining the ground state is also discussed.
Feedback-based quantum algorithms for ground state preparation
针对变分量子基态算法中高维经典优化代价过高的问题，提出基于量子 Lyapunov 控制反馈律、无需优化的基态制备算法，并验证其单调收敛性与鲁棒性。
Second order correlations reveal quantum beats from a coherent ground-state superposition on the undriven mode of a two-mode cavity QED system. Continuous drive induces decoherence due to Rayleigh scattering. We control this with feedback and explore postselection techniques to extract specific behavior.
Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
该研究将稳定子态应用于量子多体基态问题，提出稳定子基态概念，建立等价形式并开发线性扩展算法，数值验证了其可扩展性与效率，为理解和开发先进算法奠定基础。
Certain quantum many-body ground states can be prepared by a large-depth quantum circuit consisting of geometrically local gates. In the presence of noise, local expectation values deviate from the correct value at most by an amount comparable to the noise rate. This happens if the action of the noiseless circuit, restricted to certain subsystems, rapidly mixes local observables up to a small correction. The encoding circuit for the surface code is given as an example.
Robust phase estimation of the ground-state energy without controlled time evolution on a quantum device
本文提出一种无需受控时间演化、基于绝热态制备和拉姆齐型测量的基态能量估计方法，利用哈密顿量对称性制备叠加态，对非绝热跃迁鲁棒，适用于早期容错量子设备。
Discrete-Modulated Continuous-Variable Quantum Key Distribution in Satellite-to-Ground Communication
该研究针对星地量子通信需求，通过数值模拟推导不同自由空间信道条件下离散调制连续变量量子密钥分发协议的密钥率，验证了该协议在星地通信中的应用可行性。
We compare the critical behavior of the ground state and the thermal state of the XX model. We analyze the full energy spectrum and the eigenstates to reconstruct the ground state and the thermally excited state. With the solutions, we discuss about several physical properties of the states, which are related to quantum phase transition, in various limits, at zero temperature as well as at a thermal equilibrium.
Variational Quantum Eigensolvers with Quantum Gaussian Filters for solving ground-state problems in quantum many-body systems
提出一种结合变分量子本征求解器与量子高斯滤波器的量子算法，用于在NISQ设备上高效求解多体系统基态，在横场伊辛模型上展现出更快的收敛和更高的精度。
Arbitrary Ground State Observables from Quantum Computed Moments
本文扩展量子计算矩（QCM）方法，使其能从次优或含噪试探态估计任意基态可观测量，并通过Heisenberg模型磁化与自旋关联验证其抗噪优势和近期硬件潜力。
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for ground-state generation, overcomes the ground-state-generation bottleneck of the prior approach and is optimal up to a polylogarithmic factor. Specifically, we establish two quantum algorithms -- Fourier-based and wavelet-based -- to generate the ground state of a free massive scalar bosonic QFT with gate complexity quasilinear in the number of discretized-QFT mode…
We prove that there exists a family of quantum systems that can be cooled to their ground states by a one-shot projective measurement on the ancillas coupled to these systems. Consequently, this proof gives rise to the conditions for achieving the one-shot measurement ground-state cooling (OSMGSC). We also propose a general procedure for finding unitary propagators and corresponding Hamiltonians to realize such cooling by means of inverse engineering technique.
The stabilizer ground state and applications to quantum simulation
本文提出通过最优稳定子基态近似真实基态，并利用遗传算法和稳定子表格形式实现高效量子模拟。
An infinite sequence of potential well functions is considered. A trial wavefunction is used with the Schr$\ddot{\text{o}}$dinger equation to obtain an approximate ground state energy for each potential well function. We obtain an expression that is exactly correct for the harmonic potential, has an intuitively correct form for all of our potential well functions and can be understood to be a partitioning of the ground state energy into two parts, one kinetic and one potential.
Classical-Assisted Quantum Ground State Preparation with Tensor Network States and Monte Carlo Sampling
针对量子多体系统基态制备难题，提出结合张量网络态与蒙特卡洛采样的经典辅助量子方法，制备稀疏试探态，在自旋-1/2 $J_1$-$J_2$ 海森堡模型上实现重叠度多项式级改进。
Finding and probing the ground states of spin lattices, such as the antiferromagnetic Heisenberg model on the kagome lattice (KAFH), is a very challenging problem on classical computers and only possible for relatively small systems. We propose using the Variational Quantum Eigensolver (VQE) to find the ground state of the KAFH on a quantum computer. We find efficient ansatz circuits and show how physically interesting observables can be measured efficiently. To investigate the expressiveness and scaling of our ansatz circuits we used classical, exact simulations of VQE for the KAFH for differ…
Robust Variational Ground-State Solvers via Dissipative Quantum Feedback Models
本文提出了一种基于耗散量子反馈模型的变分基态求解器，通过H-infinity控制提升鲁棒性，适用于量子化学和光学实验平台。
Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States
本文使用变分量子特征求解器（VQEs）对由Heisenberg哈密顿量描述的多体系统进行纠缠检测基准测试，发现受哈密顿量相互作用启发的参数化量子电路在代价函数估计上优于问题无关电路。
Scalable Quantum Ground State Preparation of the Heisenberg Model: A Variational Quantum Eigensolver Approach
本文利用变分量子本征求解器（VQE）制备一维广义海森堡模型的基态，提出适用于所有耦合值的拟设，并评估其可扩展性与采样精度，为高效量子算法和凝聚态物理研究奠定基础。
We study the question of what kind of a macroscopic superposition can(not) naturally exist as a ground state of some gapped local many-body Hamiltonian. We derive an upper bound on the energy gap of an arbitrary physical Hamiltonian provided that its ground state is a superposition of two well-distinguishable macroscopic "semi-classical" states. For a large class of macroscopic superposition states we show that the gap vanishes in the macroscopic limit. This in turn shows that preparation of such states by simple cooling to the ground state is not experimentally feasible and requires different…
Ground-state entanglement induces emergence of negative-energy-density regions in quantum systems by squeezing zero-point oscillation, keeping total energy of the systems nonnegative. By use of the negativity of quantum energy density, protocols of quantum energy teleportation are proposed that transport energy to distant sites by local operations and classical communication. The energy is teleported without breaking any physical laws including causality and local energy conservation. Because intermediate subsystems of the energy transfer channel are not excited during the protocol execution, …
Ground state cooling of a nanomechanical resonator coupled to a superconducting flux qubit is discussed. We show that by inducing quantum interference to cancel detrimental carrier excitations, ground state cooling becomes possible in the weak-confinement or non-resolved regime. The qubit is modelled as a three-level system in lambda configuration, and the driving fluxes are applied such that the qubit absorption spectrum exhibits electromagnetically induced transparency, thereby cancelling the unwanted carrier excitation. As our interference-based scheme allows to apply strong cooling fields,…
We determine the ground state energy of atoms and quantum dots whose number N of electrons is large. We show that the dominant terms of the energy are those given by a semiclassical Hartree-Fock theory. Correlation effects appear at the order N ln N for atoms and the order N for quantum dots. We compute them. The semiclassical Hartree-Fock theory creates oscillations in the ground state energy as a function of N . These oscillations reflect the dynamics of a classical particle moving in the presence of the Thomas-Fermi potential. The dynamics is regular for atoms and some dots, but we present …
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems. By performing detailed numerics, we uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem. Importantly, unlike for the search problem, parameters such as the hopping ra…
Using a displacement operator formalism, I analyse the depopulation of the vibrational ground state of trapped ions. Two heating times, one characterizing short time behaviour, the other long time behaviour are found. The short time behaviour is analyzed both for single and multiple ions, and a formula for the relative heating rates of different modes is derived. The possibility of correction of heating via the quantum Zeno effect, and the exploitation of the suppression of heating of higher modes to reduce errors in quantum computation is considered.
One possible way to produce ultracold, high-phase-space-density quantum gases of molecules in the rovibronic ground state is given by molecule association from quantum-degenerate atomic gases on a Feshbach resonance and subsequent coherent optical multi-photon transfer into the rovibronic ground state. In ultracold samples of Cs_2 molecules, we observe two-photon dark resonances that connect the intermediate rovibrational level |v=73,J=2> with the rovibrational ground state |v=0,J=0> of the singlet $X^1Σ_g^+$ ground state potential. For precise dark resonance spectroscopy we exploit the fact t…
Quantum key distribution (QKD) uses the fundamental principles of quantum mechanics to share unconditionally secure keys between distant users. Previous works based on the quantum science satellite "Micius" have initially demonstrated the feasibility of a global QKD network. However, the practical applications of space-based QKD still face many technical problems, such as the huge size and weight of ground stations required to receive quantum signals. Here, we report space-to-ground QKD demonstrations based on portable receiving ground stations. The weight of the portable ground station is les…
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While quantum algorithms such as adiabatic quantum optimization (AQO) and quantum approximate optimization (QAOA) can minimize Hamiltonians, they are inadequate for counting ground states. We modify AQO and QAOA to count the ground states of arbitrary classical spin Hamiltonians, including counting ground states with arbitrary nonnegative weights attached to them. …
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear systems problem [Childs,Kothari,Somma'15]. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, makin…
We relax one of the requirements for topological quantum computation with Majorana fermions. Topological quantum computation was discussed so far as manipulation of the wave function within degenerate many body ground state. The simplest particles providing degenerate ground state, Majorana fermions, often coexist with extremely low energy excitations, so keeping the system in the ground state may be hard. We show that the topological protection extends to the excited states, as long as the Majorana fermions do not interact neither directly, nor via the excited states. This protection relies o…
Generating ground states of any local Hamiltonians seems to be impossible in quantum polynomial time. In this paper, we give evidence for the impossibility by applying an argument used in the quantum-computational-supremacy approach. More precisely, we show that if ground states of any $3$-local Hamiltonians can be approximately generated in quantum polynomial time with postselection, then ${\sf PP}={\sf PSPACE}$. Our result is superior to the existing findings in the sense that we reduce the impossibility to an unlikely relation between classical complexity classes. We also discuss what makes…
We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any boolean function. We therefore provide a new method of encoding universal computation in the ground states of Ising lattices, and a simpler alternative demonstration of the known fact that finding the ground state of a finite Ising spin glass model is NP complete. We relate this with our previous result about emergence properties in infinite lattices.
The two-dimensional cluster state, a universal resource for measurement-based quantum computation, is also the gapped ground state of a short-ranged Hamiltonian. Here, we examine the effect of perturbations to this Hamiltonian. We prove that, provided the perturbation is sufficiently small and respects a certain symmetry, the perturbed ground state remains a universal resource. We do this by characterising the operation of an adaptive measurement protocol throughout a suitable symmetry-protected quantum phase, relying on generic properties of the phase rather than any analytic control over the…
Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
本文综述了量子计算在非基态量子化学领域的发展，包括反应机制、反应动力学和有限温度量子化学，探讨了相关算法及挑战。
We investigate the ground-state Riemannian metric and the cyclic quantum distance of an inhomogeneous quantum Ising spin-1/2 chain in a transverse field. This model can be diagonalized by using a general canonical transformation to the fermionic Hamiltonian mapped from the spin system. The ground-state Riemannian metric is derived exactly on a parameter manifold ring $S^1$, which is introduced by performing a gauge transformation to the spin Hamiltonian through a twist operator. The ground-state cyclic quantum distance and the second derivative of the ground-state energy are studied in differe…
We present computational chemistry data for small molecules ($CO$, $HCl$, $F_2$, $NH_4^+$, $CH_4$, $NH_{3}$, $H_3O^+$, $H{_2}O$, $BeH_{2}$, $LiH$, $OH^-$, $HF$, $HeH^+$, $H_2$), obtained by implementing the Unitary Coupled Cluster method with Single and Double excitations (UCCSD) on a quantum computer simulator. We have used the Variational Quantum Eigensolver (VQE) algorithm to extract the ground state energies of these molecules. This energy data represents the expected ground state energy that a quantum computer will produce for the given molecules, on the STO-3G basis. Since there is a lot…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。