Datasets:
wesley7137
/
quantum

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
8.13M
[20] J. Dambre, D. Verstraeten, B. Schrauwen, and S. Mas- 20140520 (2014).
sar, Information processing capacity of dynamical sys- [37] Y.LeCun,Y.Bengio,andG.Hinton,DeepLearningNa-
tems, Sci. Rep. 2, 514 (2012). ture 521, 436 (2015).
[21] H.JaegerandH.Haas,Harnessingnonlinearity: predict- [38] K. Fujii and K. Nakajima, Harnessing Disordered-
ingchaoticsystemsandsavingenergyinwirelesscommu- Ensemble Quantum Dynamics for Machine Learning,
nication, Science 304, 78 (2004). Phys. Rev. Applied 8, 024030 (2017).
[22] W. Maass, T. Natschla¨ger, and H. Markram, Real-time [39] M. Negoro et al., Machine learning with controllable
computing without stable states: a new framework for quantum dynamics of a nuclear spin ensemble in a solid,
neural computation based on perturbations,NeuralCom- arXiv:1806.10910 (2018).
put. 14, 2531 (2002). [40] KNakajimaetal.,Boostingcomputationalpowerthrough
[23] C. Fernando and S. Sojakka, Pattern recognition in a spatial multiplexing in quantum reservoir computing,
bucket In Lecture Notes in Computer Science 2801, p. Phys. Rev. Applied 11, 034021 (2019).
588 (Springer, 2003).
13
[41] AKutvonen,KFujii,andTSagawa,Optimizingaquan- (2019).
tum reservoir computer for time series prediction, Sci [59] Y.Duetal.,Theexpressivepowerofparameterizedquan-
Rep 10, 14687 (2020). tum circuits, Phys. Rev. Research 2, 033125 (2020).
[42] Q. H. Tran and K. Nakajima, Higher-order quantum [60] M. Schuld et al., Evaluating analytic gradients on quan-
reservoir computing, arXiv:2006.08999 (2020). tum hardware, Phys. Rev. A 99, 032331 (2019).
[43] K. Mitarai et al., Quantum circuit learning, Phys. Rev. [61] K. Mitarai and K. Fujii, Methodology for replacing indi-
A 98, 032309 (2018). rect measurements with direct measurements,Phys.Rev.
[44] G.-B.Huang,Q.-Y.Zhu,andC.-K.Siew,Extremelearn- Research 1, 013006 (2019).
ing machine: theory and applications, Neurocomputing [62] J. G. Vidal, and D. O. Theis, Calculus on parameterized
70, 489 (2006). quantum circuits, arXiv:1812.06323 (2018).
[45] D. Verstraeten, B. Schrauwen, M. D’Haene, and D. [63] A. Harrow and N. John Low-depth gradient measure-
Stroobandt, An experimental unification of reservoir ments can improve convergence in variational hybrid
computing methods, Neural Netw. 20, 391 (2007). quantum-classical algorithms, arXiv:1901.05374 (2019).
[46] V. Havlicek et al, Supervised learning with quantum en- [64] J. R. McClean et al. Barren plateaus in quantum neural
hanced feature spaces, Nature 567, 209 (2019). network training landscapes, Nature Communications 9,
[47] E.FarhiandH.Neven,Classificationwithquantumneu- 4812 (2018).
ral networks on near term processors, arXiv:1802.06002 [65] V. Bergholm et al., PennyLane: Automatic dif-
(2018). ferentiation of hybrid quantum-classical computations,
[48] M. Schuld et al., Circuit-centric quantum classifiers, arXiv:1811.04968 (2018).
Phys. Rev. A 101, 032308 (2020). [66] Z.-Y. Chen et al., VQNet: Library for a Quantum-
[49] H. Chen et al., Universal discriminative quantum neural Classical Hybrid Neural Network, arXiv:1901.09133
networks, arXiv:1805.08654 (2018). (2019).
[50] W. Huggins et al., Towards Quantum Machine Learning [67] G. R. Steinbrecher et al., Quantum optical neural net-
withTensorNetworks,QuantumScienceandTechnology works, npj Quantum Information 5, 60 (2019).
4, 024001 (2019). [68] N. Killoran et al., Continuous-variable quantum neural
[51] I. Glasser, N. Pancotti, and J. I. Cirac, From probabilis- networks, Phys. Rev. Research 1, 033063 (2019).
tic graphical models to generalized tensor networks for [69] C. M. Wilson et al., Quantum Kitchen Sinks: An algo-
supervised learning, arXiv:1806.05964 (2018). rithm for machine learning on near-term quantum com-
[52] Y.Duetal.,ImplementableQuantumClassifierforNon- puters, arXiv:1806.08321 (2018).
linear Data, arXiv:1809.06056 (2018). [70] D.Zhuet al.,Training of Quantum Circuits on a Hybrid
[53] M.Benedettietal.,Adversarialquantumcircuitlearning Quantum Computer, Science Advances 5, 9918 (2019).
for pure state approximation, New J. Phys. 21, 043023 [71] S.Ghoshetal.,Quantumreservoirprocessing,npjQuan-
(2019). tum Information 5, 35 (2019).
[54] M. Benedetti et al., A generative modeling approach for [72] S.Ghosh,T.Paterek,andT.C.H.Liew,Quantum neu-
benchmarkingandtrainingshallowquantumcircuits,npj romorphicplatformforquantumstatepreparation,Phys.
Quantum Information 5, 45 (2019). Rev. Lett. 123, 260404 (2019).
[55] J.-G.LiuandL.Wang,Phys.Rev.A98,062324(2018). [73] S. Ghosh et al., Reconstructing quantum states with
[56] H. Situ et al., Quantum generative adversarial network quantum reservoir networks, IEEE Trans. Neural Netw.
for generating discrete data, Information Sciences 538, Learn. Syst., pp. 1–8 (2020).
193 (2020). [74] J. Chen and H. I. Nurdin, Learning Nonlinear Input-
[57] J.Zenget al.,Learning and Inference on Generative Ad- Output Maps with Dissipative Quantum Systems, Quan-
versarial Quantum Circuits, Phys. Rev. A 99, 052306 tum Information Processing 18, 198 (2019).
(2019). [75] T. Goto, Q. H. Tran and K. Nakajima, Universal ap-
[58] J. Romero and A. Aspuru-Guzik Variational quantum proximation property of quantum feature maps, arXiv:
generators: Generative adversarial quantum machine 2009.00298 (2020).
learning for continuous distributions, arXiv:1901.00848
--- End of pdfs/document_4.pdf ---
--- Start of pdfs/document_5.pdf ---
SIMULATING GROVER’S QUANTUM SEARCH IN A
CLASSICAL COMPUTER
D.K. Ningtyas and A.B. Mutiara
∗
Graduate Program in Information System, Gunadarma University,
Jl. Margonda Raya 100, Depok 16424, Indonesian.
0102 Abstract
The rapid progress of computer science has been accompanied by a corresponding evolution of
raM
computation, from classical computation to quantum computation. As quantum computing is on
itsway tobecominganestablisheddiscipline ofcomputing science, much effortisbeingputinto the
9
development of new quantum algorithms. One of quantum algorithms is Grover algorithm, which
]HO.sc[
is used for searching an element in an unstructured list of N elements with quadratic speed-up over
classical algorithms. Inthis work, Quantum Computer Language (QCL) is usedto make aGrover’s
quantum search simulation in a classical computer
1v0391.3001:viXra
PACS numbers:
∗Electronicaddress: amutiara@staff.gunadarma.ac.id;URL:http://stafsite.gunadarma.ac.id/amutiara
1
I. INTRODUCTION
A. Background of the Research
The rapid progress of computer science has been accompanied by a corresponding evo-
lution of computation, from classical computation to quantum computation. In classical
computation, computer memory made up of bits, where each bit represents either a one or
a zero. In quantum computation, there are some quantum mechanical phenomena, such as
superposition and entanglement, to perform operations on data.
Instead of using bits, quantum computation uses qubits (quantum bits). A single qubit
can represent a one, a zero, or both at the same time, which is called superposition. Because
of this ability, quantum computation can perform many tasks simultaneously, faster than
classical computing. There is also another phenomenon in quantum computation which is
called entanglement. If two qubits get an outside force, then those qubits can be entangled
condition. It means that, even the distance of both qubits is far, treating one of them will
affect the other qubit too. For example, there are two entangled qubits, and one of them has