Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Adiabatic_quantum_computation> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- Adiabatic_quantum_computation abstract "Adiabatic quantum computation (AQC) relies on the adiabatic theorem to do calculations and is closely related to quantum annealing. First, a complex Hamiltonian is found whose ground state describes the solution to the problem of interest. Next, a system with a simple Hamiltonian is prepared and initialized to the ground state. Finally, the simple Hamiltonian is adiabatically evolved to the complex Hamiltonian. By the adiabatic theorem, the system remains in the ground state, so at the end the state of the system describes the solution to the problem.AQC is a possible method to get around the problem of energy relaxation. Since the quantum system is in the ground state, interference with the outside world cannot make it move to a lower state. If the energy of the outside world (that is, the "temperature of the bath") is kept lower than the energy gap between the ground state and the next higher energy state, the system has a proportionally lower probability of going to a higher energy state. Thus the system can stay in a single system eigenstate as long as needed.Universality results in the adiabatic model are tied to quantum complexity and QMA-hard problems. The k-local Hamiltonian is QMA-complete for k ≥ 2. QMA-hardness results are known for physically realistic lattice models of qubits such as where represent the Pauli matrices . Such models are used for universal adiabatic quantum computation. The Hamiltonians for the QMA-complete problem can also be restricted to act on a two dimensional grid of qubits or a line of quantum particles with 12 states per particle. and if such models were found to be physically realisable, they too could be used to form the building blocks of a universal adiabatic quantum computer.In practice, there are problems during a computation. As the Hamiltonian is gradually changed, the interesting parts (quantum behaviour as opposed to classical) occur when multiple qubits are close to a tipping point. It is exactly at this point when the ground state (one set of qubit orientations) gets very close to a first energy state (a different arrangement of orientations). Adding a slight amount of energy (from the external bath, or as a result of slowly changing the Hamiltonian) could take the system out of the ground state, and ruin the calculation. Trying to perform the calculation more quickly increases the external energy; scaling the number of qubits makes the energy gap at the tipping points smaller.For a theoretical study of the performance of an adiabatic optimization processor see.".
- Adiabatic_quantum_computation wikiPageID "14436313".
- Adiabatic_quantum_computation wikiPageRevisionID "599886194".
- Adiabatic_quantum_computation hasPhotoCollection Adiabatic_quantum_computation.
- Adiabatic_quantum_computation subject Category:Physics_theorems.
- Adiabatic_quantum_computation subject Category:Quantum_mechanics.
- Adiabatic_quantum_computation type Abstraction100002137.
- Adiabatic_quantum_computation type Communication100033020.
- Adiabatic_quantum_computation type Message106598915.
- Adiabatic_quantum_computation type PhysicsTheorems.
- Adiabatic_quantum_computation type Proposition106750804.
- Adiabatic_quantum_computation type Statement106722453.
- Adiabatic_quantum_computation type Theorem106752293.
- Adiabatic_quantum_computation comment "Adiabatic quantum computation (AQC) relies on the adiabatic theorem to do calculations and is closely related to quantum annealing. First, a complex Hamiltonian is found whose ground state describes the solution to the problem of interest. Next, a system with a simple Hamiltonian is prepared and initialized to the ground state. Finally, the simple Hamiltonian is adiabatically evolved to the complex Hamiltonian.".
- Adiabatic_quantum_computation label "Adiabatic quantum computation".
- Adiabatic_quantum_computation sameAs m.03d3h93.
- Adiabatic_quantum_computation sameAs Q4682635.
- Adiabatic_quantum_computation sameAs Q4682635.
- Adiabatic_quantum_computation sameAs Adiabatic_quantum_computation.
- Adiabatic_quantum_computation wasDerivedFrom Adiabatic_quantum_computation?oldid=599886194.
- Adiabatic_quantum_computation isPrimaryTopicOf Adiabatic_quantum_computation.