Browse
Submit Data
Databases
API
Help

Dataset Information

10 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Quantum computation under micromotion in a planar ion crystal.

ABSTRACT: We propose a scheme to realize scalable quantum computation in a planar ion crystal confined by a Paul trap. We show that the inevitable in-plane micromotion affects the gate design via three separate effects: renormalization of the equilibrium positions, coupling to the transverse motional modes, and amplitude modulation in the addressing beam. We demonstrate that all of these effects can be taken into account and high-fidelity gates are possible in the presence of micromotion. This proposal opens the prospect to realize large-scale fault-tolerant quantum computation within a single Paul trap.

SUBMITTER: Wang ST

PROVIDER: S-EPMC4339801 | biostudies-other | 2015

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Quantum computation under micromotion in a planar ion crystal.

Wang S-T ST Shen C C Duan L-M LM

Scientific reports 20150225

We propose a scheme to realize scalable quantum computation in a planar ion crystal confined by a Paul trap. We show that the inevitable in-plane micromotion affects the gate design via three separate effects: renormalization of the equilibrium positions, coupling to the transverse motional modes, and amplitude modulation in the addressing beam. We demonstrate that all of these effects can be taken into account and high-fidelity gates are possible in the presence of micromotion. This proposal op ...[more]

PMID: 25711774

Similar Datasets

Modular quantum computation in a trapped ion system.

Project description:Modern computation relies crucially on modular architectures, breaking a complex algorithm into self-contained subroutines. A client can then call upon a remote server to implement parts of the computation independently via an application programming interface (API). Present APIs relay only classical information. Here we implement a quantum API that enables a client to estimate the absolute value of the trace of a server-provided unitary operation [Formula: see text]. We demonstrate that the algorithm functions correctly irrespective of what unitary [Formula: see text] the server implements or how the server specifically realizes [Formula: see text]. Our experiment involves pioneering techniques to coherently swap qubits encoded within the motional states of a trapped [Formula: see text] ion, controlled on its hyperfine state. This constitutes the first demonstration of modular computation in the quantum regime, providing a step towards scalable, parallelization of quantum computation.

| S-EPMC6795904 | biostudies-other

Geometry of quantum computation with qudits.

Project description:The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(d(n)). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound.

| S-EPMC4070285 | biostudies-literature

Quantum computation with universal error mitigation on a superconducting quantum processor.

Project description:Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, these devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge of exploring the advantage of quantum computation is to minimize the impact of device and control imperfections without complete logical encoding. Quantum error mitigation is a solution satisfying the requirement. Here, we demonstrate an error mitigation protocol based on gate set tomography and quasi-probability decomposition. One- and two-qubit circuits are tested on a superconducting device, and computation errors are successfully suppressed. Because this protocol is universal for digital quantum computers and algorithms computing expected values, our results suggest that error mitigation can be an essential component of near-future quantum computation.

| S-EPMC6731091 | biostudies-literature

Quantum experiments and graphs II: Quantum interference, computation, and state generation.

Project description:We present an approach to describe state-of-the-art photonic quantum experiments using graph theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that introducing complex weights in graphs naturally leads to quantum interference. This viewpoint immediately leads to many interesting results, some of which we present here. First, we identify an experimental unexplored multiphoton interference phenomenon. Second, we find that computing the results of such experiments is #P-hard, which means it is a classically intractable problem dealing with the computation of a matrix function Permanent and its generalization Hafnian. Third, we explain how a recent no-go result applies generally to linear optical quantum experiments, thus revealing important insights into quantum state generation with current photonic technology. Fourth, we show how to describe quantum protocols such as entanglement swapping in a graphical way. The uncovered bridge between quantum experiments and graph theory offers another perspective on a widely used technology and immediately raises many follow-up questions.

| S-EPMC6410807 | biostudies-literature

Trapped-ion toolkit for studies of quantum harmonic oscillators under extreme conditions.

Project description:Many phenomena described in relativistic quantum field theory are inaccessible to direct observations, but analogue processes studied under well-defined laboratory conditions can present an alternative perspective. Recently, we demonstrated an analogy of particle creation using an intrinsically robust motional mode of two trapped atomic ions. Here, we substantially extend our classical control techniques by implementing machine-learning strategies in our platform and, consequently, increase the accessible parameter regime. As a proof of methodology, we present experimental results of multiple quenches and parametric modulation of an unprotected motional mode of a single ion, demonstrating the increased level of real-time control. In combination with previous results, we enable future experiments that may yield entanglement generation using a process in analogy to Hawking radiation. This article is part of a discussion meeting issue 'The next generation of analogue gravity experiments'.

| S-EPMC7422877 | biostudies-literature

Hyper-parallel photonic quantum computation with coupled quantum dots.

Project description:It is well known that a parallel quantum computer is more powerful than a classical one. So far, there are some important works about the construction of universal quantum logic gates, the key elements in quantum computation. However, they are focused on operating on one degree of freedom (DOF) of quantum systems. Here, we investigate the possibility of achieving scalable hyper-parallel quantum computation based on two DOFs of photon systems. We construct a deterministic hyper-controlled-not (hyper-CNOT) gate operating on both the spatial-mode and the polarization DOFs of a two-photon system simultaneously, by exploiting the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics (QED). This hyper-CNOT gate is implemented by manipulating the four qubits in the two DOFs of a two-photon system without auxiliary spatial modes or polarization modes. It reduces the operation time and the resources consumed in quantum information processing, and it is more robust against the photonic dissipation noise, compared with the integration of several cascaded CNOT gates in one DOF.

| S-EPMC3983618 | biostudies-other

Quantum approximate Bayesian computation for NMR model inference.

Project description:Recent technological advances may lead to the development of small scale quantum computers capable of solving problems that cannot be tackled with classical computers. A limited number of algorithms has been proposed and their relevance to real world problems is a subject of active investigation. Analysis of many-body quantum system is particularly challenging for classical computers due to the exponential scaling of Hilbert space dimension with the number of particles. Hence, solving problems relevant to chemistry and condensed matter physics are expected to be the first successful applications of quantum computers. In this paper, we propose another class of problems from the quantum realm that can be solved efficiently on quantum computers: model inference for nuclear magnetic resonance (NMR) spectroscopy, which is important for biological and medical research. Our results are based on three interconnected studies. Firstly, we use methods from classical machine learning to analyze a dataset of NMR spectra of small molecules. We perform a stochastic neighborhood embedding and identify clusters of spectra, and demonstrate that these clusters are correlated with the covalent structure of the molecules. Secondly, we propose a simple and efficient method, aided by a quantum simulator, to extract the NMR spectrum of any hypothetical molecule described by a parametric Heisenberg model. Thirdly, we propose a simple variational Bayesian inference procedure for extracting Hamiltonian parameters of experimentally relevant NMR spectra.

| S-EPMC7643990 | biostudies-literature

Hybrid architecture for encoded measurement-based quantum computation.

Project description:We present a hybrid scheme for quantum computation that combines the modular structure of elementary building blocks used in the circuit model with the advantages of a measurement-based approach to quantum computation. We show how to construct optimal resource states of minimal size to implement elementary building blocks for encoded quantum computation in a measurement-based way, including states for error correction and encoded gates. The performance of the scheme is determined by the quality of the resource states, where within the considered error model a threshold of the order of 10% local noise per particle for fault-tolerant quantum computation and quantum communication.

| S-EPMC4064337 | biostudies-literature

Topological quantum computation based on chiral Majorana fermions.

Project description:The chiral Majorana fermion is a massless self-conjugate fermion which can arise as the edge state of certain 2D topological matters. It has been theoretically predicted and experimentally observed in a hybrid device of a quantum anomalous Hall insulator and a conventional superconductor. Its closely related cousin, the Majorana zero mode in the bulk of the corresponding topological matter, is known to be applicable in topological quantum computations. Here we show that the propagation of chiral Majorana fermions leads to the same unitary transformation as that in the braiding of Majorana zero modes and propose a platform to perform quantum computation with chiral Majorana fermions. A Corbino ring junction of the hybrid device can use quantum coherent chiral Majorana fermions to implement the Hadamard gate and the phase gate, and the junction conductance yields a natural readout for the qubit state.

| S-EPMC6205432 | biostudies-literature

Blind topological measurement-based quantum computation.

Project description:Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3 × 10(-3), which is comparable to that (7.5 × 10(-3)) of non-blind topological quantum computation. As the error per gate of the order 10(-3) was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

| S-EPMC3658012 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data