Loading

Error: Cannot Load Popup Box

Hit List

Title:

Medical students and the Royal Commission.

Author:

Year of Publication:

1968-05-25

Document Type:

Text

Language:

en

Subjects:

Research Article

Research Article Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Simulation of Many-Body Fermi Systems on a Universal Quantum Computer

Description:

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symm...

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail. ; Comment: Submitted 11/7/96 to Phys. Rev. Lett. 10 pages, 0 figures Minimize

Year of Publication:

1997-03-28

Document Type:

text

Subjects:

Quantum Physics

Quantum Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems

Description:

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates. It is argued that virtually any deterministic nonlinear quantum theory will inc...

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates. It is argued that virtually any deterministic nonlinear quantum theory will include such gates, and the method is explicitly demonstrated using the Weinberg model of nonlinear quantum mechanics. ; Comment: 10 pages, no figures, submitted to Phys. Rev. Lett Minimize

Year of Publication:

1998-01-20

Document Type:

text

Subjects:

Quantum Physics

Quantum Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors

Description:

We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algor...

We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algorithm to specific problems are considered, and we find that classically intractable and interesting problems from atomic physics may be solved with between 50 and 100 quantum bits. ; Comment: 10 pages Minimize

Year of Publication:

1998-07-24

Document Type:

text

Subjects:

Quantum Physics

Quantum Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems

Author:

Description:

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates. It is argued that virtually any deterministic nonlinear quantum theory will inc...

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates. It is argued that virtually any deterministic nonlinear quantum theory will include such gates, and the method is explicitly demonstrated using the Weinberg model of nonlinear quantum mechanics. Minimize

Year of Publication:

1998

Language:

eng

Subjects:

General Theoretical Physics

General Theoretical Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Title not available

Description:

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems 1

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems 1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-12-05

Source:

http://arxiv.org/pdf/quant-ph/9801041v1.pdf

http://arxiv.org/pdf/quant-ph/9801041v1.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Quantum algorithm providing an exponential speed increase for finding eigenvalues and eigenvectors

Description:

1

1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-12-05

Source:

http://arxiv.org/pdf/quant-ph/9807070v1.pdf

http://arxiv.org/pdf/quant-ph/9807070v1.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Simulation of many-body fermi systems on a universal quantum computer. (Online preprint quant-ph/9703054

Description:

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for antisymme...

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for antisymmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail. PACS numbers: 03.65.-w, 02.70.-c, 89.80.+h 1 Since the discovery by Shor of a quantum algorithm for factoring in polynomial time [1], there has been tremendous activity in the field of quantum computation [2-9,11-18,20-22,26-27,32-33]. Recent results include the first experimental demonstrations of working quantum logic gates[2-4], quantum error-correcting codes [5], and many novel proposals for the design of actual quantum computers [3,6-10]. For a review of progress in quantum computation, see references 11 or 12. Despite these advances, the technical hurdles that stand in the way of factoring a large number on a quantum computer remain daunting[13-16]. But the problem of simulation- that is, the problem of modeling the full Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-12-05

Source:

http://arxiv.org/pdf/quant-ph/9703054v1.pdf

http://arxiv.org/pdf/quant-ph/9703054v1.pdf Minimize

Document Type:

text

Language:

en

DDC:

190 Modern western philosophy *(computed)*

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Two endogenous neuropeptides modulate the gill and siphon withdrawal reflex in Aplysia by presynaptic facilitation involving cAMP-dependent closure of a serotonin-sensitive potassium channel.

Author:

Description:

We have found that two endogenous neuropeptides in Aplysia, the small cardioactive peptides SCPA and SCPB, facilitate synaptic transmission from siphon mechano-sensory neurons and enhance the defensive withdrawal reflex that these sensory neurons mediate. Single-channel recording revealed that these peptides close a specific K+ channel, the S ch...

We have found that two endogenous neuropeptides in Aplysia, the small cardioactive peptides SCPA and SCPB, facilitate synaptic transmission from siphon mechano-sensory neurons and enhance the defensive withdrawal reflex that these sensory neurons mediate. Single-channel recording revealed that these peptides close a specific K+ channel, the S channel, which is sensitive to cAMP. Moreover, the peptides increase cAMP levels in these sensory neurons. This reduction in K+ current slows the repolarization of the action potential in these cells, which increases transmitter release. In these actions, the SCPs resemble both noxious sensitizing stimuli, which enhance the reflex, and serotonin. Bioassay of HPLC fractions of abdominal ganglion extracts and immunocytochemistry indicate that both the SCPs and serotonin are present in the ganglion and are found in processes close to the siphon sensory neurons, suggesting that these transmitters may be involved in behavioral sensitization. Recent evidence suggests that one group of identified facilitatory interneurons, the L29 cells, does not appear to contain either the SCPs or serotonin but may use yet another facilitatory transmitter. Thus, it appears that several transmitters can converge to produce presynaptic facilitation in the sensory neurons of the defensive withdrawal reflex. All of the transmitters studied here, the SCPs and serotonin, act via an identical molecular cascade: cAMP-dependent closure of the S-K+ channel, broadening of the presynaptic action potential, and facilitation of transmitter release. Minimize

Year of Publication:

1984-12

Document Type:

Text

Language:

en

Subjects:

Research Article

Research Article Minimize

DDC:

590 Animals (Zoology) *(computed)*

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Age model of ODP Site 113-697 (Table 2), supplement to: Burckle, Lloyd H; Gersonde, Rainer; Abrams, Nelson (1990): Late Pliocene-Pleistocene paleoclimate in the Jane Basin region: ODP Site 697. In: Barker, PF; Kennett, JP; et al. (eds.), Proceedings of the Ocean Drilling Program, Scientific Results, College Station, TX (Ocean Drilling Program), 113, 803-812

Author:

Description:

Abstract ; We examined diatom preservation patterns in Pliocene age sediments of Jane Basin (ODP Site 697) and compared them with diatom distribution in more northerly sites at various sectors of the Southern Ocean. Our data from Site 697, as well as other sites from around the Southern Ocean, support the view that there was significant ice grow...

Abstract ; We examined diatom preservation patterns in Pliocene age sediments of Jane Basin (ODP Site 697) and compared them with diatom distribution in more northerly sites at various sectors of the Southern Ocean. Our data from Site 697, as well as other sites from around the Southern Ocean, support the view that there was significant ice growth on Antarctica during the late Pliocene. DSDP Site 514 in the Atlantic sector shows increased relative abundance of Eucampia antarctica, an ice-related form, in the upper part of the Gauss Chron with a larger increase just above it. With one exception, all sites included in the present study show increased relative abundance of E. antarctica in the upper part of the Gauss. Our view that there was ice growth on Antarctica during the late Gauss Chron is supported by the results from ODP Site 697. While diatoms are present and percent opal is high in the early and middle Gauss Chron (suggesting more open-ocean conditions), late Gauss sediments contain low percentages of opal and few or no diatoms. This is also true for the early Matuyama Chron. If we accept spring and summer sea-ice cover as the major suppressant of diatom productivity in the Southern Ocean, then we conclude that sea-ice covered the region around Site 697 through much of the year during this interval. Further, the absence of diatoms and the low percentages of opal in middle and late Matuyama chron sediments suggests increased sea-ice cover over the Jane Basin during this time. Although warmer openocean intervals are inferred for intervals near the Olduvai and Jaramillo Subchrons, most of the Matuyama Chron was marked by extensive sea-ice cover with low seasonal contrast. Our results for the early part of the Brunhes Chron are similar, at least for the Jane Basin. During this time, sea-ice cover over the basin apparently extended well into the growing season. In contrast, the later Brunhes Chron is marked by alternating open water (during the growing season) and extensive, almost year-round, sea-ice. Minimize

Publisher:

PANGAEA - Data Publisher for Earth & Environmental Science

Year of Publication:

1990

Document Type:

Dataset ; Supplementary Dataset

Language:

eng

Subjects:

GetInfo ; Age model ; Ageprofile Datum Description ; Age model ; paleomagnetic ; Leg113 ; Joides Resolution ; Ocean Drilling Program (ODP)

GetInfo ; Age model ; Ageprofile Datum Description ; Age model ; paleomagnetic ; Leg113 ; Joides Resolution ; Ocean Drilling Program (ODP) Minimize

Rights:

Creative Commons Attribution 3.0 Unported (CC-BY) ; http://creativecommons.org/licenses/by/3.0/

Creative Commons Attribution 3.0 Unported (CC-BY) ; http://creativecommons.org/licenses/by/3.0/ Minimize

Relations:

doi:10.2973/odp.proc.sr.113.203.1990

My Lists:

My Tags:

Notes:

Currently in BASE: 70,930,940 Documents of 3,410 Content Sources

http://www.base-search.net