Browse
Submit Data
Databases
API
Help

Dataset Information

40 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator.

ABSTRACT: Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here, we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground-state energy of the Transverse Field Ising Model with long-range interactions with tunable range, and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot, individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground-state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward toward the application of the QAOA to more general problem instances.

SUBMITTER: Pagano G

PROVIDER: S-EPMC7568299 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Maximizing gerrymandering through ising model optimization.

Project description:By using the Ising model formulation for combinatorial optimization with 0-1 binary variables, we investigated the extent to which partisan gerrymandering is possible from a random but even distribution of supporters. Assuming that an electoral district consists of square subareas and that each subarea shares at least one edge with other subareas in the district, it was possible to find the most tilted assignment of seats in most cases. However, in cases where supporters' distribution included many enclaves, the maximum tilted assignment was usually found to fail. We also discussed the proposed algorithm is applicable to other fields such as the redistribution of delivery destinations.

| S-EPMC8655093 | biostudies-literature

Observation of a quantum phase transition in the quantum Rabi model with a single trapped ion.

Project description:Quantum phase transitions (QPTs) are usually associated with many-body systems in the thermodynamic limit when their ground states show abrupt changes at zero temperature with variation of a parameter in the Hamiltonian. Recently it has been realized that a QPT can also occur in a system composed of only a two-level atom and a single-mode bosonic field, described by the quantum Rabi model (QRM). Here we report an experimental demonstration of a QPT in the QRM using a 171Yb+ ion in a Paul trap. We measure the spin-up state population and the average phonon number of the ion as two order parameters and observe clear evidence of the phase transition via adiabatic tuning of the coupling between the ion and its spatial motion. An experimental probe of the phase transition in a fundamental quantum optics model without imposing the thermodynamic limit opens up a window for controlled study of QPTs and quantum critical phenomena.

| S-EPMC7893029 | biostudies-literature

Scaling quantum approximate optimization on near-term hardware.

Project description:The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

| S-EPMC9300688 | biostudies-literature

From transistor to trapped-ion computers for quantum chemistry.

Project description:Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

| S-EPMC5378044 | biostudies-literature

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer.

Project description:The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.

| S-EPMC7381638 | biostudies-literature

Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions.

Project description:Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers. Recently it has been revealed that warm-start approaches can improve the performance of QAOA, where approximate solutions are obtained by classical algorithms in advance and incorporated into the initial state and/or unitary ansatz. In this work, we study in detail how the accuracy of approximate solutions affects the performance of the warm-start QAOA (WS-QAOA). We numerically find that in typical MAX-CUT problems, WS-QAOA achieves higher fidelity (probability that exact solutions are observed) and approximation ratio than QAOA as the Hamming distance of approximate solutions to the exact ones becomes smaller. We reveal that this could be quantitatively attributed to the initial state of the ansatz. We also solve MAX-CUT problems by WS-QAOA with approximate solutions obtained via QAOA, having higher fidelity and approximation ratio than QAOA especially when the circuit is relatively shallow. We believe that our study may deepen understanding of the performance of WS-QAOA and also provide a guide as to the necessary quality of approximate solutions.

| S-EPMC10786944 | biostudies-literature

Blueprint for a microwave trapped ion quantum computer.

Project description:The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion-based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation-based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error-threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects.

| S-EPMC5287699 | biostudies-other

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

Quantum Rabi Model with Trapped Ions.

Project description:We propose the quantum simulation of the quantum Rabi model in all parameter regimes by means of detuned bichromatic sideband excitations of a single trapped ion. We show that current setups can reproduce, in particular, the ultrastrong and deep strong coupling regimes of such a paradigmatic light-matter interaction. Furthermore, associated with these extreme dipolar regimes, we study the controlled generation and detection of their entangled ground states by means of adiabatic methods. Ion traps have arguably performed the first quantum simulation of the Jaynes-Cummings model, a restricted regime of the quantum Rabi model where the rotating-wave approximation holds. We show that one can go beyond and experimentally investigate the quantum simulation of coupling regimes of the quantum Rabi model that are difficult to achieve with natural dipolar interactions.

| S-EPMC4611475 | biostudies-other

Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer.

Project description:Efficiently entangling pairs of qubits is essential to fully harness the power of quantum computing. Here, we devise an exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer. The protocol requires classical computational resources polynomial in the system size, and very little overhead in the quantum control compared to a single-pair case. We demonstrate an exponential improvement in both classical and quantum resources over the current state of the art. We implement the protocol on a software-defined trapped-ion quantum computer, where we reconfigure the quantum computer architecture on demand. Our protocol may also be extended to a wide variety of other quantum computing platforms.

| S-EPMC7289877 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

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