The Experts below are selected from a list of 45690 Experts worldwide ranked by ideXlab platform
C Monroe - One of the best experts on this subject based on the ideXlab platform.
-
parallel entangling operations on a universal ion trap Quantum Computer
Nature, 2019Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling Quantum gates offers efficiency gains in numerous Quantum circuits2–4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and Quantum simulations6,7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, Quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9,10. However, the implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11,12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a Quantum Computer using a depth-four Quantum circuit4,14,15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up Quantum circuits and achieve fault tolerance in trapped-ion Quantum Computers. Parallel two-qubit entangling gates are realized in an array of fully connected trapped-ion qubits, achieving a full-adder operation on a Quantum processor with an average fidelity of 83.3 per cent.
-
measuring the renyi entropy of a two site fermi hubbard model on a trapped ion Quantum Computer
Physical Review A, 2018Co-Authors: N M Linke, Caroline Figgatt, K A Landsman, Sonika Johri, A Y Matsuura, C MonroeAbstract:The efficient simulation of correlated Quantum systems is a promising near-term application of Quantum Computers. Here, we present a measurement of the second R\'enyi entropy of the ground state of the two-site Fermi-Hubbard model on a five-qubit programmable Quantum Computer based on trapped ions. Our work illustrates the extraction of a nonlinear characteristic of a Quantum state using a controlled-swap gate acting on two copies of the state. This scalable measurement of entanglement on a universal Quantum Computer will, with more qubits, provide insights into many-body Quantum systems that are impossible to simulate on classical Computers.
-
parallel entangling operations on a universal ion trap Quantum Computer
arXiv: Quantum Physics, 2018Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling Quantum gates offers clear efficiency gains in numerous Quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and Quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, Quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a Quantum Computer using a depth-4 Quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up Quantum circuits and achieving fault tolerance with trapped ion Quantum Computers.
-
complete 3 qubit grover search on a programmable Quantum Computer
Nature Communications, 2017Co-Authors: Caroline Figgatt, Dmitri Maslov, Shantanu Debnath, N M Linke, K A Landsman, C MonroeAbstract:The Grover Quantum search algorithm is a hallmark application of a Quantum Computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable Quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
-
large scale modular Quantum Computer architecture with atomic memory and photonic interconnects
Physical Review A, 2014Co-Authors: C Monroe, Kenneth R Brown, Robert Raussendorf, A Ruthven, Peter Maunz, L M DuanAbstract:The practical construction of scalable Quantum-Computer hardware capable of executing nontrivial Quantum algorithms will require the juxtaposition of different types of Quantum systems. We analyze a modular ion trap Quantum-Computer architecture with a hierarchy of interactions that can scale to very large numbers of qubits. Local entangling Quantum gates between qubit memories within a single register are accomplished using natural interactions between the qubits, and entanglement between separate registers is completed via a probabilistic photonic interface between qubits in different registers, even over large distances. We show that this architecture can be made fault tolerant, and demonstrate its viability for fault-tolerant execution of modest size Quantum circuits.
P C Stancil - One of the best experts on this subject based on the ideXlab platform.
-
simulating the transverse ising model on a Quantum Computer error correction with the surface code
Physical Review A, 2013Co-Authors: Hao You, Michael R Geller, P C StancilAbstract:We estimate the resource requirements for the Quantum simulation of the ground state energy of the one dimensional Quantum transverse Ising model (TIM), based on the surface code implementation of a fault tolerant Quantum Computer. The surface code approach has one of the highest known tolerable error rates (1%) which makes it currently one of the most practical Quantum computing schemes. Compared to results of the same model using the concatenated Steane code, the current results indicate that the simulation time is comparable but the number of physical qubits for the surface code is 2-3 orders of magnitude larger than that of the concatenation code. Considering that the error threshold requirements of the surface code is four orders of magnitude higher than the concatenation code, building a Quantum Computer with a surface code implementation appears more promising given current physical hardware capabilities.
-
simulating the transverse ising model on a Quantum Computer error correction with the surface code
Bulletin of the American Physical Society, 2013Co-Authors: Hao You, Michael R Geller, P C StancilAbstract:We estimate the resource requirements for the Quantum simulation of the ground-state energy of the onedimensional Quantum transverse Ising model based on the surface code implementation of a fault-tolerant Quantum Computer. The surface code approach has one of the highest known tolerable error rates (∼1%) which makes it currently one of the most practical Quantum computing schemes. Compared to results of the same model using the concatenated Steane code, the current results indicate that the simulation time is comparable but the number of physical qubits for the surface code is one to two orders of magnitude larger than that of the concatenation code. Considering that the error threshold requirement of the surface code is four orders of magnitude higher than the concatenation code, building a Quantum Computer with a surface code implementation appears more promising given current physical hardware capabilities.
Caroline Figgatt - One of the best experts on this subject based on the ideXlab platform.
-
parallel entangling operations on a universal ion trap Quantum Computer
Nature, 2019Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling Quantum gates offers efficiency gains in numerous Quantum circuits2–4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and Quantum simulations6,7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, Quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9,10. However, the implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11,12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a Quantum Computer using a depth-four Quantum circuit4,14,15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up Quantum circuits and achieve fault tolerance in trapped-ion Quantum Computers. Parallel two-qubit entangling gates are realized in an array of fully connected trapped-ion qubits, achieving a full-adder operation on a Quantum processor with an average fidelity of 83.3 per cent.
-
measuring the renyi entropy of a two site fermi hubbard model on a trapped ion Quantum Computer
Physical Review A, 2018Co-Authors: N M Linke, Caroline Figgatt, K A Landsman, Sonika Johri, A Y Matsuura, C MonroeAbstract:The efficient simulation of correlated Quantum systems is a promising near-term application of Quantum Computers. Here, we present a measurement of the second R\'enyi entropy of the ground state of the two-site Fermi-Hubbard model on a five-qubit programmable Quantum Computer based on trapped ions. Our work illustrates the extraction of a nonlinear characteristic of a Quantum state using a controlled-swap gate acting on two copies of the state. This scalable measurement of entanglement on a universal Quantum Computer will, with more qubits, provide insights into many-body Quantum systems that are impossible to simulate on classical Computers.
-
parallel entangling operations on a universal ion trap Quantum Computer
arXiv: Quantum Physics, 2018Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling Quantum gates offers clear efficiency gains in numerous Quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and Quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, Quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a Quantum Computer using a depth-4 Quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up Quantum circuits and achieving fault tolerance with trapped ion Quantum Computers.
-
complete 3 qubit grover search on a programmable Quantum Computer
Nature Communications, 2017Co-Authors: Caroline Figgatt, Dmitri Maslov, Shantanu Debnath, N M Linke, K A Landsman, C MonroeAbstract:The Grover Quantum search algorithm is a hallmark application of a Quantum Computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable Quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
Dmitri Maslov - One of the best experts on this subject based on the ideXlab platform.
-
ground state energy estimation of the water molecule on a trapped ion Quantum Computer
npj Quantum Information, 2020Co-Authors: Yunseong Nam, Jwosy Chen, Neal C Pisenti, Kenneth Wright, Conor Delaney, Dmitri Maslov, Kenneth R Brown, Stewart O Allen, J M Amini, Joel ApisdorfAbstract:Quantum computing leverages the Quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical Computers. Examples include calculating molecular and nuclear structure, simulating strongly interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to Quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available Quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here we describe an extensible co-design framework for solving chemistry problems on a trapped-ion Quantum Computer and apply it to estimating the ground-state energy of the water molecule using the variational Quantum eigensolver (VQE) method. The controllability of the trapped-ion Quantum Computer enables robust energy estimates using the prepared VQE ansatz states. The systematic and statistical errors are comparable to the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics, without resorting to any error mitigation techniques based on Richardson extrapolation.
-
parallel entangling operations on a universal ion trap Quantum Computer
Nature, 2019Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling Quantum gates offers efficiency gains in numerous Quantum circuits2–4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and Quantum simulations6,7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, Quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9,10. However, the implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11,12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a Quantum Computer using a depth-four Quantum circuit4,14,15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up Quantum circuits and achieve fault tolerance in trapped-ion Quantum Computers. Parallel two-qubit entangling gates are realized in an array of fully connected trapped-ion qubits, achieving a full-adder operation on a Quantum processor with an average fidelity of 83.3 per cent.
-
ground state energy estimation of the water molecule on a trapped ion Quantum Computer
arXiv: Quantum Physics, 2019Co-Authors: Yunseong Nam, Jwosy Chen, Neal C Pisenti, Kenneth Wright, Conor Delaney, Dmitri Maslov, Kenneth R Brown, Stewart O Allen, J M Amini, Joel ApisdorfAbstract:Quantum computing leverages the Quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical Computers. Examples include calculating molecular and nuclear structure, simulating strongly-interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to Quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available Quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here, we describe a scalable co-design framework for solving chemistry problems on a trapped ion Quantum Computer, and apply it to compute the ground-state energy of the water molecule. The robust operation of the trapped ion Quantum Computer yields energy estimates with errors approaching the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics.
-
parallel entangling operations on a universal ion trap Quantum Computer
arXiv: Quantum Physics, 2018Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling Quantum gates offers clear efficiency gains in numerous Quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and Quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, Quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a Quantum Computer using a depth-4 Quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up Quantum circuits and achieving fault tolerance with trapped ion Quantum Computers.
-
complete 3 qubit grover search on a programmable Quantum Computer
Nature Communications, 2017Co-Authors: Caroline Figgatt, Dmitri Maslov, Shantanu Debnath, N M Linke, K A Landsman, C MonroeAbstract:The Grover Quantum search algorithm is a hallmark application of a Quantum Computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable Quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
N M Linke - One of the best experts on this subject based on the ideXlab platform.
-
parallel entangling operations on a universal ion trap Quantum Computer
Nature, 2019Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations1. The ability to execute parallel entangling Quantum gates offers efficiency gains in numerous Quantum circuits2–4, as well as for entire algorithms—such as Shor’s factoring algorithm5—and Quantum simulations6,7. In circuits such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time through the divide-and-conquer technique8. More importantly, Quantum gate parallelism is essential for fault-tolerant error correction of qubits that suffer from idle errors9,10. However, the implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits that are fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions11,12 or cavity-coupled superconducting transmons13. Here we present experimental results for parallel two-qubit entangling gates in an array of fully connected trapped 171Yb+ ion qubits. We perform a one-bit full-addition operation on a Quantum Computer using a depth-four Quantum circuit4,14,15, where circuit depth denotes the number of runtime steps required. Our method exploits the power of highly connected qubit systems using classical control techniques and will help to speed up Quantum circuits and achieve fault tolerance in trapped-ion Quantum Computers. Parallel two-qubit entangling gates are realized in an array of fully connected trapped-ion qubits, achieving a full-adder operation on a Quantum processor with an average fidelity of 83.3 per cent.
-
measuring the renyi entropy of a two site fermi hubbard model on a trapped ion Quantum Computer
Physical Review A, 2018Co-Authors: N M Linke, Caroline Figgatt, K A Landsman, Sonika Johri, A Y Matsuura, C MonroeAbstract:The efficient simulation of correlated Quantum systems is a promising near-term application of Quantum Computers. Here, we present a measurement of the second R\'enyi entropy of the ground state of the two-site Fermi-Hubbard model on a five-qubit programmable Quantum Computer based on trapped ions. Our work illustrates the extraction of a nonlinear characteristic of a Quantum state using a controlled-swap gate acting on two copies of the state. This scalable measurement of entanglement on a universal Quantum Computer will, with more qubits, provide insights into many-body Quantum systems that are impossible to simulate on classical Computers.
-
parallel entangling operations on a universal ion trap Quantum Computer
arXiv: Quantum Physics, 2018Co-Authors: Caroline Figgatt, Dmitri Maslov, Aaron Ostrander, N M Linke, K A Landsman, D Zhu, C MonroeAbstract:The circuit model of a Quantum Computer consists of sequences of gate operations between Quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling Quantum gates offers clear efficiency gains in numerous Quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and Quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, Quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel Quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a Quantum Computer using a depth-4 Quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up Quantum circuits and achieving fault tolerance with trapped ion Quantum Computers.
-
complete 3 qubit grover search on a programmable Quantum Computer
Nature Communications, 2017Co-Authors: Caroline Figgatt, Dmitri Maslov, Shantanu Debnath, N M Linke, K A Landsman, C MonroeAbstract:The Grover Quantum search algorithm is a hallmark application of a Quantum Computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable Quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
