Top

Quantum Information Processing

Published in:

01-05-2014

A quantum multiply-accumulator

Authors: Christopher M. Maynard, Einar Pius

Published in: Quantum Information Processing | Issue 5/2014

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

This paper proposes a quantum multiply-accumulator circuit (QMAC), which can perform the calculation on conventional integers faster than its classical counterpart. Whereas classically applying a multiply–adder (MAC) \(n\) times to \(k\) bit integers would require \(O(n \log k)\) parallel steps, the hybrid QMAC needs only \(O(n + k)\) steps for the exact result and \(O(n + \log k)\) steps for an approximate result. The proposed circuit could potentially be embedded in a conventional computer architecture as a quantum device or accelerator, enabling a wide range of applications to execute faster.

previous article The uniform measure for discrete-time quantum walks in one dimension

next article Checking noise correlations for safer two-way quantum key distribution

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

See for example [7] for a textbook on circuit design.

Bonneau, D., Engin, E., Ohira, K., Suzuki, N., Yoshida, H., Iizuka, N., Ezaki, M., Natarajan, C.M., Tanner, M.G., Hadfield, R.H., Dorenbos, S.N., Zwiller, V., O’Brien, J.L., Thompson, M.G.: Quantum interference and manipulation of entanglement in silicon wire waveguide quantum circuits. J. Phys. A Math. Theor. 14(4), 045003 (2012)

Baxter, R., Booth, S., Bull, M., Cawood, G., Perry, J., Parsons, M., Simpson, A., Trew, A., McCormick, A., Smart, G., Smart, R., Cantle, A., Chamberlain, R., Genest, G.: Maxwell—a 64 FPGA supercomputer. In: 2nd NASA/ESA Conference on Adaptive Hardware and Systems, pp. 287–294, Edinburgh, August 2007. IEEE

Almer, O., Bennett, R. V., Böhm, I., Murray, A. C., Qu, X., Zuluaga, M., Franke, B., Topham, N. P.: An end-to-end design flow for automated instruction set extension and complex instruction selection based on GCC. In: Proceedings of 1st International Workshop on GCC Research Opportunities, (2009)

Liu, D.: Embedded DSP Processor Design: Application Specific Instruction Set Processors. Systems on Silicon. Morgan Kaufmann, Linkoping University (2008)

Vedral, V., Barenco, A., Ekert, A.: Quantum networks for elementary arithmetic operations. Phys. Rev. A 54(1), 147–153 (1996)MathSciNetCrossRefADS

Beckman, David, Chari, Amalavoyal, Devabhaktuni, Srikrishna, Preskill, John: Efficient networks for quantum factoring. Phys. Rev. A 54(2), 1034–1063 (1996)MathSciNetCrossRefADS

Smith, M.J.S.: Application-Specific Integrated Circuits, 1st edn. Addison-Wesley Professional, Reading, MA (1997)

Cheng, K.-W., Tseng, C.-C.: Quantum full adder and subtractor. Electron. Lett. 38(22), 1343–1344 (2002)CrossRef

Cuccaro, Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv.org, October 2004

10.

Chakrabarti, A., Sur-Kolay, S.: Designing quantum adder circuits and evaluating their error performance. In: International Conference on Electronic Design, pp. 1–6, December 2008

11.

Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10(9 &10), 872–890 (2010)MathSciNetMATH

12.

Raussendorf, R., Browne, D., Briegel, H.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68, 022312 (2003)

13.

Draper, T.G., Kutin, S.A., Svore, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. Quantum Inf. Comput. 6(4 &5), 351–369 (2006)MathSciNetMATH

14.

Jamal, L., Shamsujjoha, M., Babu, H.M.H.: Design of optimal reversible carry look-ahead adder with optimal garbage and quantum cost. Int. J. Eng. Technol. 2(1), 44–50 (2012)

15.

Trisetyarso, A., Van Meter, R.: Circuit design for a measurement-based quantum carry-lookahead adder. Int. J. Quantum Inf. 8(5), 843–867 (2010)CrossRefMATH

16.

Draper, T.G.: Addition on a quantum computer. arXiv.org, August 2000

17.

Álvarez-Sánchez, J.J., Álvarez-Bravo, J.V., Nieto, L.M.: A quantum architecture for multiplying signed integers. J. Phys. Conf. Ser. 128(1), 1–9 (2008)

18.

Thapliyal, H., Srinivas, M.B.: Novel reversible multiplier architecture using reversible TSG gate. In: IEEE International Conference on Computer Systems and Applications, pp. 100–103, May 2006

19.

Thapliyal, H., Srinivas, M.B.: Novel reversible ‘TSG’ gate and its application for designing components of primitive reversible/quantum ALU. In: Fifth International Conference on Information, Communications and Signal Processing, 2005, pp. 1425–1429 (2005)

20.

Fahdil, M.A., Al-Azawi, A.F., Said, S.: Operations algorithms on quantum computer. Int. J. Comput. Sci. Netw. Secur. 10(1), 85–95 (2010)

21.

Thomsen, M.K., Glück, R., Axelsen, H.B.: Reversible arithmetic logic unit for quantum arithmetic. J. Phys. A Math. Theor. 43(38), 382002 (2010)

22.

Syamala, Y., Tilak, A.V.N.: Reversible arithmetic logic unit. In: 3rd International Conference on Electronics Computer Technology, pp. 207–211 (2011)

23.

Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2011)

24.

Moore, C., Nilsson, M.: Parallel quantum computation and quantum codes. SIAM J. Comput. 31(3), 799–815 (2001)MathSciNetCrossRefMATH

25.

Cleve, R., Watrous, J.: Fast parallel circuits for the quantum Fourier transform. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 526–536, Rendo Beach, CA, USA. IEEE Computer Society (2000)

26.

Wallace, C.S.: A suggestion for a fast multiplier. IEEE Trans. Electro. Comput. EC-13(1), 14–17 (1964)

27.

Dadda, L.: Some schemes for parallel multipliers. Alta Frequenza 34, 349–356 (1965)

28.

Griffiths, R., Niu, C.-S.: Semiclassical Fourier transform for quantum computation. Phys. Rev. Lett. 76(17), 3228–3231 (1996)CrossRefADS

Title: A quantum multiply-accumulator
Authors: Christopher M. Maynard
Einar Pius
Publication date: 01-05-2014
Publisher: Springer US
Published in: Quantum Information Processing / Issue 5/2014
Print ISSN: 1570-0755
Electronic ISSN: 1573-1332
DOI: https://doi.org/10.1007/s11128-013-0715-5

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 5/2014

Multi-qudit information splitting with multiple controllers

Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits

A quantum model for autonomous learning automata

Quantum random walk polynomial and quantum random walk measure

Three schemes of remote information concentration based on ancilla-free phase-covariant telecloning

Quantum secret sharing with continuous variable graph state