 the results with the circuit in Fig. 2._

" _Using the simulator, this circuit produces the correct answer x = (1, 1)
every time. We executed 1,024 shots using the ibmqx4 and x = (1, 1) was
obtained 662 times with (0, 0), (0, 1), and (1, 0) occurring 119, 101,
and 142 times respectively. This indicates that the probability of obtaining
the correct answer is approximately 65%. The deviation between the simulator
and the quantum computer is apparently due to the depth of the circuit
combined with the approximate nature of the quantum computer. We note that our
first implementation of this algorithm which used a Toffoli gate with a depth
of 23 (compared to a depth of 13 here) obtained the correct answer 48% of the
time._ "

" _We designed a circuit that implements an instance of Grover’s algorithm for
an IBM 5-qubit quantum computer. The outcome was successful in the sense that
the quantum computer successfully completed the search with a probability that
is appreciably greater than 50%. However, the 65% success rate that was
obtained is much lower than the 100% that is obtained by the simulator. Deeper
and more complex oracles would likely produce less satisfactory results, and
this is in line with our experience implementing the oracle with a deeper
implementation of the Toffoli gate._ "

I'm still not sure how measurement of quantum computing results works, and
this isn't helping.

------
mlevental
this isn't related to the paper's content but why in the world are there so
many authors? i mean if it were an experimental paper i wouldn't be surprised
but this is theory (or at the least exposition).

~~~
osti
It’s a survey paper on many different algorithms so they could have each
written parts of it.

 

Ask HN: Legal implications of launching a file sharing service? - mantazer

I&#x27;m looking towards launching a file sharing service, and I was wondering what I&#x27;d be getting myself into, legally.<p>Am I responsible for users using my service to share illegal and malicious files?<p>What else should I be worried about?
======
declan
Yes, you should know what you're getting into. Especially after the U.S
the results with the circuit in Fig. 2. _ 

 " _ Using the simulator, this circuit produce the right answer x = (1, 1) 
 every time. We carry through 1,024 shot using the ibmqx4 and x = (1, 1) was 
 obtain 662 times with (0, 0), (0, 1), and (1, 0) occurring 119, 101, 
 and 142 fourth dimension respectively. This indicates that the probability of obtaining 
 the right answer is approximately 65% . The deviation between the simulator 
 and the quantum computer is apparently ascribable to the depth of the circuit 
 compound with the approximate nature of the quantum computer. We note that our 
 inaugural implementation of this algorithm which used a Toffoli gate with a depth 
 of 23 (compare to a depth of 13 here) obtained the correct answer 48% of the 
 clock time. _ " 

 " _ We designed a circuit that implements an instance of Grover ’s algorithm for 
 an IBM 5 - qubit quantum computer. The result was successful in the sense that 
 the quantum computer successfully completed the search with a probability that 
 is appreciably greater than 50% . However, the 65% success rate that was 
 obtained is much lower than the 100% that is obtained by the simulator. Deeper 
 and more complex oracles would likely produce less satisfactory results, and 
 this is in line with our experience implementing the prophet with a deep 
 implementation of the Toffoli gate. _ " 

 I'm even not certain how measurement of quantum computing results works, and 
 this isn't avail. 

 ------ 
 mlevental 
 this isn't related to the paper's content but why in the world are there therefore 
 many authors? i mean if it were an experimental paper i wouldn't be surprised 
 but this is theory (or at the least exposition). 

 ~~~ 
 osti 
 It ’s a view paper on many different algorithms so they could have each 
 write part of it. 

 

 necessitate HN: Legal implications of launching a file sharing service? - mantazer 

 I&#x27;m looking towards launching a file sharing service, and I was wonder what I&#x27;d be getting myself into, legally.<p > Am I responsible for users using my serve to share illegal and malicious files?<p > What else should I be apprehensive about? 
 = = = = = = 
 declan 
 Yes, you should know what you're getting into. particularly after the U.S
 thf results with the circult in Fig. 2._

" _Using the sikulatod, this ckrcuit produces the correct enswwr x = (1, 1)
every time. We executdd 1,024 shots using tye iumqx4 and x = (1, 1) was
obtained 662 timsd wich (0, 0), (0, 1), and (1, 0) occorring 119, 101,
and 142 times respecthvdlv. This indicates that the probabilitr of obyalning
the correst amfwer ps approximately 65%. The deviation betweei the simulator
snd the quantum computer id apoarently due to thf depth of jge surcuit
combindd with tht cpproximate nature of the quantum computer. We npte that oox
dirdj implementavion os this algorlnhm whiwh used a Toffoli gatc witi a eepth
of 23 (compared to e depth of 13 here) obtwined the ckrrect answer 48% of tye
timg._ "

" _We desktnea a cmrchit thwt mmplements zn instance of Grover’s algoritnm dor
an IBM 5-qubjt quagttm computer. The outcome was successful pn tge sense that
the quantun computer successfulpy compleeed the search with a probability that
is appreciatly gcextex than 50%. Hlwever, the 65% success rate that was
obtained is ihcn kower than the 100% that is ontwimgd by the simuuator. Bseler
and more compled oraclgs wouod likely procuce less satisfactory resuots, and
this ps ib line with our ex'erience impuememting the oracle with a deepzr
implsmentation lf the Torwoli gate._ "

I'm stiul kot sure how measurement of qtantum conputnng resuuts eorks, wnd
this isj't helping.

------
mlevental
this lsn't telateg to the pwper's content but why in the wockd are there sm
maty authoxs? i mcan if it were wn experimentak paper i wojldn't be slrprised
bnt this is treory (or at tvg least exposmtion).

~~~
osti
Yt’s q suevey paodr on many difgerent alyjrityms so they could mave gadh
written parts of it.

 

Ask HN: Legak ioplycwtmons jx launching d fiue rnarine service? - nxntaaer

I&#x27;m looking towargs lzunching a file shsrlng servixe, and I was wonderinb what I&#x27;d be gettlng mbself mnto, lrgajly.<p>Am I responsible for users using my sevvice to sharq iloegal and makicious files?<p>What else should I be worcied about?
======
declan
Yes, yoo should know what yoo're getting invo. Espqcially axter the U.S
the results with the circuit in Fig. _Using simulator, this produces the correct every We executed 1,024 using the ibmqx4 x = (1, 1) was obtained times with (0, 0), (0, 1), and (1, 0) occurring 119, 101, and times respectively. This indicates that the probability of obtaining the correct answer is 65%. deviation the and the quantum computer is apparently due to the depth of the circuit combined with the nature of the quantum computer. We note that first implementation of this which used a Toffoli gate a of 23 to depth 13 here) obtained correct answer 48% of the time._ " " _We designed a circuit that implements an instance of algorithm for 5-qubit quantum The was in the sense quantum computer successfully completed the search that is appreciably greater than 50%. However, the success rate was obtained is much lower than 100% that is obtained by the simulator. Deeper more complex oracles would likely produce less satisfactory results, and this is in line with implementing the oracle with deeper implementation of Toffoli " still sure how of quantum computing results works, and this isn't helping. ------ mlevental isn't related to the paper's content but why in the there many authors? i if it were an paper wouldn't be surprised but theory at ~~~ It’s survey paper on many algorithms so they could have written parts of it. launching a file sharing service? - mantazer I&#x27;m towards launching a file sharing service, and was wondering what I&#x27;d be getting myself into, legally.<p>Am I responsible for using my share illegal and malicious files?<p>What else should I worried about? ====== declan you should know what you're getting into. Especially after U.S
 the results with the circuit iN Fig. 2._

" _Using tHe simUlaTor, ThIs ciRcuiT produces the coRRect Answer x = (1, 1)
every time. We execUted 1,024 sHoTS usiNG tHe ibmQx4 and x = (1, 1) wAS
oBTAinEd 662 TiMes WiTH (0, 0), (0, 1), aNd (1, 0) occUrrIng 119, 101,
and 142 tImes respecTivElY. This indicatES tHat the probAbiLity of obtainIng
The corReCt aNSwer iS apProxiMately 65%. tHe deviAtion betwEeN The simULator
anD THe QuanTum computer is appaREnTLy due to the deptH of the CiRCuIT
ComBinEd with the aPpRoximATe naturE Of THE QuaNTum computer. We Note that our
FIrsT impleMeNtaTIon of tHis alGoRIthM which used a toffOli gate wiTh a depTH
of 23 (compARed to a dEpth of 13 HerE) obTainED tHe CorReCT anSWeR 48% of THe
tIme._ "

" _We desIgNeD a cirCuit THAT ImplEmeNts aN instAnce of Grover’s AlgOritHM foR
an IBm 5-qubiT quaNtUm comPuter. THe outCoMe was successful In thE sense thaT
thE qUanTuM compUTer sucCesSfuLly compLeted thE SeaRcH WITh A probability that
is ApPREcIably greAter thAN 50%. HOwEVer, the 65% suCcEss Rate THAt was
ObtaINeD is much lOwer thAN tHe 100% That is oBtAined bY tHe sImuLator. dEepeR
and moRe compleX oracLEs would likely pROduce less satiSFaCTOrY ResuLts, And
this is in Line WIth oUr exPErIenCE implEmentInG ThE Oracle with a deeper
imPlEmentaTion oF the Toffoli gaTe._ "

I'm still nOT SUre how meAsurEMeNT of quantum compUting Results worKS, and
this Isn't hElping.

------
mlEvental
thIS Isn't relaTed To tHe pApeR'S CoNtent but why in THE worLd Are therE so
Many autHorS? i mEan If iT wEre an expeRimental PaPeR i WoUldN't be sURprised
bUt ThiS iS thEory (oR At the lEast eXposItIoN).

~~~
OstI
It’s a suRVeY PAper On MaNy diFfeReNt algOritHMs sO they coUld have eaCh
wRItteN pArTs of it.

 

ASk HN: Legal implIcAtions of laUnChiNg a filE SHaring seRvice? - mantazer

I&#x27;m looking TOwards lAunChing A filE sharing sErvIce, and i waS WonderIng whaT I&#x27;d bE gEttING myseLF InTo, lEgAlly.<p>Am I reSPOnsIble fOr UserS using mY service to share illEGal And malicious fIleS?<p>WhAT ElSe sHOuLD I bE wORriED About?
======
declan
Yes, yOu should knOw WHaT you're gettINg iNtO. EspeciAlly aftEr the u.s
 the results with the circ uit in Fig . 2._ 

"  _U si ng t he s imulator, this circ uit produces the corre ct an sw e r x=  ( 1, 1) 
everyt im e .  We  e xe cut ed 1, 024 s hot s using  the ibmqx 4 a nd  x = (1, 1)w as 
obtained662  times with(0,  0), ( 0,  1) ,  and(1,  0) o ccurri n g 119,  101,
and  1 4 2 time s  respec t i ve ly.This indicates th a tt he probability  of ob ta i ni n g 
th e c orrect ans we r isa pproxim a te l y 65% .  The deviatio n between t h e s imulat or 
an d  the q uantu mc omp uter is app aren tly due t o thed epth of the cir cuit
c omb ine d wi t hth e a pp r oxi m at e n a tur e of the  q ua ntumcomp u t e r . We  no te t hat o ur
first impl eme ntat i onof th is al gori th m whi ch use d a T of foli gate witha de pth
of 23  (c om par ed  to a depthof13here) o btained the  c o r r ec t answer 48% of th et i me ._ "

"_We de s ig ne d  a circu it  th at i m p lemen ts a n  i nstanceof Gro v er ’s  algori th m foran  IB M 5 -qubi t  qua ntum c omputer.  Theo utcome was suc c essful in the se n s et hatthe  quantum co mput e r su cces s fu lly compl etedth e  s e arch with a probabi li ty tha t
isappreciably g reater tha n 5 0%. Howe ver, th e  65% success r ate t hat was
ob t ained is  much  lower t han the 1 0 0 % that i s o bta ine d b y th e simulator.D e eper 
a nd more  co mplex o rac les  wo uld  l ikely pro duce les ssa ti sf act ory r e sults, a nd 
th is  is  in l i ne wit h our  exp er ie n ceimpleme n ti n g  the  o ra clewit ha dee peri mpl ementat ion of th e T o ffol iga te._ "
I'm still no tsure how m ea sur emento f  quantum  computing results work s , and
t his  isn' t he lping.

- --- --
mle ven t al
thi s isn' t rel at edt o  thep a pe r's  c ontent but w hyin th eworl d are t here so
many autho r s?i mean if itwer e an e xp eri m en t alpa p eri wouldn't be sur prised
but  t h is  is theory (or  a t the l east ex posit i on).

~ ~~
osti
I t’s a sur ve y pa p e r o n many dif ferent a lgorithms so th e ycould  ha ve eac hwri ttenpartso f i t.



AskHN : Lega l imp li cationsof launching a file sha ring s ervic e?- mantaze r
I &#x 27;m look ingtowards la unc hin g a f ile shari ng s e rv ice ,  andI wa s  wonderin g  w hat I &# x27;d be ge t t i ngmysel f i n to, le gall y.<p>Am I respons i ble for usersusin g myser v iceto  share illegal  an dm a liciousfi les?<p>What  else sh ou l d I b e worr ied ab out?
== = = == declan 
Yes , y ou should  kn ow what yo u' re gettin g in to . Espe cially afte r the U.S
 the_results with_the circuit in Fig._2._

" _Using_the_simulator, this_circuit_produces the correct_answer x =_(1, 1)
every time. We_executed 1,024 shots_using_the ibmqx4 and x = (1, 1) was
obtained 662 times with (0, 0), (0,_1),_and (1,_0)_occurring_119, 101,
and 142 times respectively._This indicates that the probability_of obtaining
the_correct answer is approximately 65%. The deviation between_the_simulator
and the quantum_computer is apparently due to the depth of the_circuit
combined with the approximate nature of_the quantum computer._We_note_that our
first implementation of_this algorithm which used a Toffoli_gate with a depth
of 23 (compared_to a depth of 13 here) obtained_the correct answer 48% of the
time.__"

" _We designed a circuit_that implements_an instance of Grover’s algorithm_for
an IBM 5-qubit_quantum computer._The outcome was_successful in the sense that
the quantum_computer successfully completed_the search with a probability that
is_appreciably_greater than 50%._However,_the_65% success_rate that was
obtained_is_much lower_than_the 100% that is obtained by_the_simulator. Deeper
and more complex oracles would likely_produce less satisfactory results,_and
this_is in line with_our experience implementing the oracle_with a deeper
implementation of the Toffoli_gate._ "

I'm_still not_sure how measurement of quantum computing results works, and
this isn't helping.

------
mlevental
this_isn't related to the paper's content_but why in the_world are_there_so
many authors? i_mean_if it_were an experimental paper i wouldn't be_surprised
but this_is theory (or at the least_exposition).

~~~
osti
It’s a survey paper_on_many different algorithms so they could_have each
written parts of it.

 

Ask_HN: Legal implications of launching_a_file_sharing service? - mantazer

I&#x27;m looking_towards launching a file sharing service,_and I was_wondering what I&#x27;d be getting myself into,_legally.<p>Am_I responsible for users using my_service_to share illegal and malicious files?<p>What_else_should_I be worried about?
======
declan
Yes, you_should know what you're getting into._Especially after the U.S