In this work we investigate a model of thermalization wherein a single ancillary qubit randomly interacts with the system to be thermalized. This not only sheds light on the emergence of Gibbs states in nature, but also provides a routine for preparing arbitrary thermal states on a digital quantum computer. For desired $β$ and random interaction $G$ the routine boils down to time independent Hamiltonian simulation and is represented by the channel $Φ: ρ\mapsto \mathbb{E}_G {\rm Tr}_{\rm Env} \left[ e^{-i(H + αG)t} \left(ρ\otimes \frac{e^{-βH_E}}{\mathcal{Z}}\right) e^{i (H + αG)t} \right]$. We rigorously prove that these dynamics reduce to a Markov chain process in the weak-coupling regime with the thermal state as the approximate fixed point. We upper bound the total simulation time required in terms of the Markov chain spectral gap $λ_\star$, which we compute exactly in the ground state limit. These results are independent of any eigenvalue knowledge of the system, but we are further able to show that with knowledge of eigenvalue differences $λ_S(i) - λ_S(j)$, then the total simulation time is dramatically reduced. The ratio of the complete ignorance simulation cost to the perfect knowledge simulation cost scales as $\widetilde{O} \left({\frac{\|{H_S}\|^7}{δ_{\rm min}^7 ε^{3.5} λ_\star(β)^{3.5}}}\right)$, where $δ_{\min}$ is related to the eigenvalue differences of the system. Additionally, we provide more specific results for single qubit and harmonic oscillator systems as well as numeric experiments with hydrogen chains. In addition to the algorithmic merits, these results can be viewed as broad extensions of the Repeated Interactions model to generic Hamiltonians with unknown interactions, giving a complete picture of the thermalization process for quantum systems.
We demonstrate an improved concatenated encoded ancilla preparation procedure. Simulations show that this procedure significantly increases the error threshold beneath which arbitrarily long quantum computations are possible.
We schedule the Steane [[7,1,3]] error correction on a model ion trap architecture with ballistic transport. We compare the level one error rates for syndrome extraction using the Shor method of ancilla prepared in verified cat states to the DiVincenzo-Aliferis method without verification. The study examines how the quantum error correction circuit latency and error vary with the number of available ancilla and the choice of protocol for ancilla preparation and measurement. We find that with few exceptions the DiVincenzo-Aliferis method without cat state verification outperforms the standard S…
Fault-tolerant quantum computation using quantum error-correcting codes requires fault-tolerant constructions of nontransversal gates. Shor proposed a fault-tolerant construction of a nontransversal gate, i.e., the Toffoli gate for a family of the Calderbank-Shor-Steane codes which has even-weight stabilizer generators and odd-weight logical operators. In fact, as shown in this paper, error propagations in the ancilla preparation of Shor's construction lead to logical errors. This work provides a solution to this problem through the insertion of bit flip error correction. Finally, error rates …
In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization. We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla p…
Fault-tolerant quantum computation (FTQC) schemes that use multi-qubit large block codes can potentially reduce the resource overhead to a great extent. A major obstacle is the requirement of a large number of clean ancilla states of different types without correlated errors inside each block. These ancilla states are usually logical stabilizer states of the data code blocks, which are generally difficult to prepare if the code size is large. Previously we have proposed an ancilla distillation protocol for Calderbank-Shor-Steane (CSS) codes by classical error-correcting codes. It was assumed t…
A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=\lceil \log_2N\rceil$-qubit state. It has been proven that any algorithm universally implementing this subroutine would need at least $\mathcal O(N)$ constant weight operations. However, the proof assumes that only $n$ qubits are used, whereas the circuit depth could be reduced by extending the space and allowing ancillary qubits. Here we investigate this space-time tradeoff in quantum state preparation with classical data. We propose quantum algorithms with $\ma…
The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|ψ_v\rangle =\sum_{k=0}^{2^n-1}v_k|k\rangle$ from the initial state $|0\rangle^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\ldots,v_{2^n-1})^T\in \mathbb{C}^{2^n}$ with $\|v\|_2 = 1$. The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available. In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare…
TARE: Block Encoding Linear Combinations of Pauli Strings Without Ancilla State Preparation
Fraunhofer-Institut für Arbeitswirtschaft und Organisation IAO（弗劳恩霍夫工作经济与组织研究所）；Universität Stuttgart, Institut für Arbeitswissenschaft und Technologiemanagement IAT（斯图加特大学劳动科学与技术管理研究所）；Fraunhofer-Institut für Angewandte Festkörperphysik IAF（弗劳恩霍夫应用固体物理研究所）；Albert-Ludwigs-Universität Freiburg（弗赖堡阿尔伯特·路德维希大学）
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are available in a number of scalable quantum technologies (complete unitary control on the target system, an ancillary resettable qubit and controlled-not gates between the target and the ancilla), and can be seen as a "quantum-controller" implementation of a sequence of classical feedback loops. We show how a large degree of flexibility exists in engineering the req…
Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算联合中心，美国国家标准与技术研究院/马里兰大学）；Joint Quantum Institute, NIST/University of Maryland（联合量子研究所，美国国家标准与技术研究院/马里兰大学）；Department of Physics, University of Maryland（马里兰大学物理系）；Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland（马里兰大学计算机科学与高级计算机科学研究所）
A scheme for the extraction of entanglement in two noninteracting qubits (spins) is proposed. The idea is to make use of resonant transmission of ancilla qubit through the two fixed qubits, controlled by the entanglement in the scatterers. Repetition of the resonant transmission extracts the singlet state in the target qubits from their arbitrary given state. Neither the preparation nor the post-selection of the ancilla spin is required, in contrast to the previously proposed schemes.
The overhead cost of performing universal fault-tolerant quantum computation for large scale quantum algorithms is very high. Despite several attempts at alternative schemes, magic state distillation remains one of the most efficient schemes for simulating non-Clifford gates in a fault-tolerant way. However, since magic state distillation circuits are not fault-tolerant, all Clifford operations must be encoded in a large distance code in order to have comparable failure rates with the magic states being distilled. In this work, we introduce a new concept which we call redundant ancilla encodin…
We consider the problem of minimizing resources required for universal quantum computation using only projective measurements. The resources we focus on are observables, which describe projective measurements, and ancillary qubits. We show that the set of observables {Z \otimes X, (cosθ)X + (sinθ)Y all θ\in [0, 2π)} with one ancillary qubit is universal for quantum computation. The set is simpler than a previous one in the sense that one-qubit projective measurements described by the observables in the set are ones only in the (X,Y) plane of the Bloch sphere. The proof of the universality imme…
Protocol for Purifying Noisy Preparation and Measurements of Qubits
Korea Advanced Institute of Science and Technology (KAIST)（韩国科学技术院）；Aalborg University（奥尔堡大学）；Technical University of Munich（慕尼黑工业大学）；Walther-Meißner-Institut, Bayerische Akademie der Wissenschaften（瓦尔特·迈斯纳研究所，巴伐利亚科学院）
A scheme for preparing two fixed non-interacting qubits in a maximally entangled state is presented. By repeating on- and off-resonant scattering of ancilla qubits, the state of the target qubits is driven from an arbitrary initial state into the singlet state with probability 1 (perfect efficiency). Neither the preparation nor the post-selection of the ancilla spin state is required. The convergence from an arbitrary input state to the unique fixed point (mixing property) is proved rigorously, and its robustness is investigated, by scrutinizing the effects of imperfections in the incident wav…
We study the typical entanglement properties of a system comprising two independent qubit environments interacting via a shuttling ancilla. The initial preparation of the environments is modeled using random-matrix techniques. The entanglement measure used in our study is then averaged over many histories of randomly prepared environmental states. Under a Heisenberg interaction model, the average entanglement between the ancilla and one of the environments remains constant, regardless of the preparation of the latter and the details of the interaction. We also show that, upon suitable kinemati…
We propose a class of preparation schemes for orbital angular momentum and polarisation qubits carried by single photons or classical states of light based on coherent feedback control by an ancillary degree of freedom of light. The preparation methods use linear optics and include the transcription of an arbitrary polarisation state onto a two-level OAM system (swap) for arbitrary OAM values plus/minus "l" within a light beam, i.e. without spatial interferometer. The preparations can be carried out with unit efficiency independent from the potentially unknown initial state of the system. More…
By using an ancilla qubit as a mediator, two distant qubits can undergo a non-local entangling unitary operation. This is desirable for when attempting to scale up or distribute quantum computation by combining fixed static local sets of qubits with ballistic mediators. Using a model driven by measurements on the ancilla, it is possible to generate a maximally entangling CZ gate while only having access to a less entangling gate between the pair qubits and the ancilla. However this results in a stochastic process of generating control phase rotation gates where the expected time for success do…
We present a Dicke state preparation scheme which uses global control of $N$ spin qubits: our scheme is based on the standard phase estimation algorithm, which estimates the eigenvalue of a unitary operator. The scheme prepares a Dicke state non-deterministically by collectively coupling the spins to an ancilla qubit via a $ZZ$-interaction, using $\ceil*{\log_2 N} + 1$ ancilla qubit measurements. The preparation of such Dicke states can be useful if the spins in the ensemble are used for magnetic sensing: we discuss a possible realization using an ensemble of electronic spins located at diamon…
A scheme for the deterministic joint remote preparation of a four- qubit cluster-type state using only two Greenberger-Horne-Zeilinger (GHZ) states as quantum channels is presented. In this scheme, the first sender per- forms a two-qubit projective measurement according to the real coefficient of the desired state. Then, the other sender utilizes the measurement result and the complex coefficient to perform another projective measurement. To obtain the desired state, the receiver applies appropriate unitary operations to his/her own two qubits and two CNOT operations to the two ancillary ones.…
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…
Quantum state preparation plays an equally important role with quantum operations and measurements in quantum information processing. The previous methods of preparing initial state for bulk quantum computation all have inevitable disadvantages, such as, requiring multiple experiments, causing loss of signals, or requiring molecules with restrictive structure. In this work, three kinds of quantum circuits are introduced to prepare the pseudo-pure states of ($n-1$) qubits in the Hilbert space of $n$ coupled spins which merely need the assist of one ancilla spin and two experiments independent o…
Magic state distillation is one of the leading candidates for implementing universal fault-tolerant logical gates. However, the distillation circuits themselves are not fault-tolerant, so there is additional cost to first implement encoded Clifford gates with negligible error. In this paper we present a scheme to fault-tolerantly and directly prepare magic states using flag qubits. One of these schemes uses a single extra ancilla, even with noisy Clifford gates. We compare the physical qubit and gate cost of this scheme to the magic state distillation protocol of Meier, Eastin, and Knill, whic…
Wire cutting is a technique for partitioning large quantum circuits into smaller subcircuits in such a way that observables for the original circuits can be estimated from measurements on the smaller subcircuits. Such techniques provide workarounds for the limited numbers of qubits that are available on near-term quantum devices. Wire cutting, however, introduces multiplicative factors in the number of times such subcircuits need to be executed in order to estimate desired quantum observables to desired levels of statistical accuracy. An optimal wire-cutting methodology has recently been repor…
Quantum error correction methods use processing power to combat noise. The noise level which can be tolerated in a fault-tolerant method is therefore a function of the computational resources available, especially the size of computer and degree of parallelism. I present an analysis of error correction with block codes, made fault-tolerant through the use of prepared ancilla blocks. The preparation and verification of the ancillas is described in detail. It is shown that the ancillas need only be verified against a small set of errors. This, combined with previously known advantages, makes thi…
Google Quantum AI（谷歌量子人工智能）；Department of Combinatorics and Optimization and Institute for Quantum Computing, University of Waterloo（滑铁卢大学组合优化与量子计算研究所）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）；Computing and Mathematical Sciences Department, Caltech（加州理工学院计算与数学科学系）
We have investigated theoretically and experimentally a method for preparing Dicke states in trapped atomic ions. We consider a linear chain of $N$ ion qubits that is prepared in a particular Fock state of motion, $|m>$. The $m$ phonons are removed by applying a laser pulse globally to the $N$ qubits, and converting the motional excitation to $m$ flipped spins. The global nature of this pulse ensures that the $m$ flipped spins are shared by all the target ions in a state that is a close approximation to the Dicke state $\D{N}{m}$. We calculate numerically the fidelity limits of the protocol an…
Quantum universality can be achieved using classically controlled stabilizer operations and repeated preparation of certain ancilla states. Which ancilla states suffice for universality? This "magic states distillation" question is closely related to quantum fault tolerance. Lower bounds on the noise tolerable on the ancilla help give lower bounds on the tolerable noise rate threshold for fault-tolerant computation. Upper bounds show the limits of threshold upper-bound arguments based on the Gottesman-Knill theorem. We extend the range of single-qubit mixed states that are known to give univer…
