相关论文: Static Quantum Computation
In systems considered for quantum computing, i.e., for control of quantum dynamics with the goal of processing information coherently, decoherence and deviation from pure quantum states, are the main obstacles to fault-tolerant error…
The quantum world is fascinating. It presents a description of nature that defies our most rooted concepts about what reality is. For example, quantum objects possess \lq\lq spooky\rq\rq\ properties that allow them to be in multiple places…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
We study a two-state quantum system with a non linearity intended to describe interactions with a complex environment, arising through a non local coupling term. We study the stability of particular solutions, obtained as constrained…
Quantum information can be processed using large ensembles of ultracold and trapped neutral atoms, building naturally on the techniques developed for high-precision spectroscopy and metrology. This article reviews some of the most important…
A Lyapunov-based method is presented for stabilizing and controlling of closed quantum systems. The proposed method is constructed upon a novel quantum Lyapunov function of the system state trajectory tracking error. A positive-definite…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the…
Protecting quantum information from the detrimental effects of decoherence and lack of precise quantum control is a central challenge that must be overcome if a large robust quantum computer is to be constructed. The traditional approach to…
Quantum computing holds transformative potential for medical applications, yet efficiently preparing quantum states from complex medical data remains a fundamental challenge. This survey provides a comprehensive examination of current…
Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser…
Quantum computing has the potential to revolutionize computing for certain classes of problems with exponential scaling, and yet this potential is accompanied by significant sensitivity to noise, requiring sophisticated error correction and…
Voltage peaks on a conventional computer's power lines allow for the well-known dangerous DPA attacks. We show that measurement of a quantum computer's transient state during a computational step reveals information about a complete…
Conformal field theories have been extremely useful in our quest to understand physical phenomena in many different branches of physics, starting from condensed matter all the way up to high energy. Here we discuss applications of…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
Quantum reservoir computing has emerged as a promising paradigm within the field of quantum machine learning, harnessing the inherent properties of quantum systems to optimise and enhance information processing capabilities. Here, we…
We describe a new and consistent perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by non-resonant transitions are estimated. We verify our…
A quantum computer that stores information on two-state systems called quantum bits or qubits must be able to address and manipulate individual qubits, to effect coherent interactions between pairs of qubits, and to read out the value of…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…