Quantum Computers Can Search Rapidly by Using Almost Any Transformation
about
sameAs
The Quantum Binding Problem in the Context of Associative Memory.Multi-target-qubit unconventional geometric phase gate in a multi-cavity system.Incoherent control of locally controllable quantum systems.Quantum search on graphene lattices.Continuous-Variable Instantaneous Quantum Computing is Hard to Sample.Delocalization border and onset of chaos in a model of quantum computation.Synthesis of quantum superpositions by quantum computationQuantum computation through entangling single photons in multipath interferometersCritically damped quantum search.Fixed-point quantum search.Implementation of quantum search algorithm using classical Fourier optics.Fast quantum search algorithms in protein sequence comparisons: quantum bioinformatics.Sophisticated quantum search without entanglementQuantum WalksImplementing a conditionalN-qubit phase gate in a largely detuned optical cavityOne-step implementation of anN-qubit controlled-phase gate with neutral atoms trapped in an optical cavityQuantum phase gate of photonic qubits in a cavity QED systemQuantum phase gate through a dispersive atom-field interactionArtificial intelligence and a universal quantum computerProblem-solving and Quantum ComputationTree search and quantum computationRobust logic gates and realistic quantum computationError tolerance in an NMR implementation of Grover’s fixed-point quantum search algorithmA new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
P2860
Q36125431-C6BF996C-9CAD-4BA0-961B-AB51B9F44803Q36602437-B9B82207-D735-4000-BEFA-9E56C3C54A76Q47206146-15CB7056-0A8E-4F53-B99C-54709B29EDDCQ51107140-83C415F1-7F8B-4BBD-A333-5A2CDD6D1549Q51565354-79D75DC8-AB6E-4DDB-93EB-A084A9C53F21Q51642231-3B624730-140A-49B9-A8AB-907C8C1FAEEBQ51644529-71519EE4-6213-49B1-B7B8-669B45ED42A9Q51644547-1E9D64AA-86C4-4C87-81CB-63F881CB4476Q51821486-22E13011-AE68-45CC-875B-B71BCF0A18B4Q51961480-7BB2A99B-D5DE-434A-A97B-2F5DEC3F5641Q52042737-3A27CA64-689E-417B-812E-D3F4BDB8D88BQ52070449-2217ACEA-E6AD-44CB-8DA0-47559B96F946Q52074584-5A7491E7-C734-4071-A29C-6AF161C58D75Q56813123-D9FB86D4-ABCD-442E-8446-780C8EAA9DE3Q57647891-A99585BD-8CE6-4107-B0D3-822BE4C11926Q57647900-8C105EA9-86D6-40F7-9A93-07374BC165B0Q57647904-71DAC4C7-9732-4B06-8831-4B8AC377F462Q57647908-AA6EC7A2-E221-4F52-9694-D9E90F12E4FDQ57696145-5101C48F-CAA0-49E1-A66C-410BA0CDC04CQ57696201-BEFEFDED-DB30-48E6-A32C-65F3BC70B7CCQ57696207-ACD8A1AD-D43C-4365-83A2-0AF28B8379A5Q57908566-90F02E19-DB0C-4912-B4FE-2ECB0AAA6A61Q57908575-FC7EC122-0940-49EA-8F8E-8834EB1AB97DQ58895424-590BB430-216D-4F66-B6E7-96F3C2DA6C0F
P2860
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
description
1998 nî lūn-bûn
@nan
1998 թուականի Մայիսին հրատարակուած գիտական յօդուած
@hyw
1998 թվականի մայիսին հրատարակված գիտական հոդված
@hy
1998年の論文
@ja
1998年論文
@yue
1998年論文
@zh-hant
1998年論文
@zh-hk
1998年論文
@zh-mo
1998年論文
@zh-tw
1998年论文
@wuu
name
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@ast
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en-gb
type
label
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@ast
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en-gb
prefLabel
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@ast
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en-gb
P3181
P1476
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
@en
P304
P3181
P356
10.1103/PHYSREVLETT.80.4329
P407
P50
P577
1998-05-01T00:00:00Z
1998-05-11T00:00:00Z
P818
quant-ph/9712011