Relevant bibliographies by topics / Deutsch Jozsa Algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Deutsch Jozsa Algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Deutsch Jozsa Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Deutsch Jozsa Algorithm"

1

Qiu, Daowen, and Shenggen Zheng. "Revisiting Deutsch-Jozsa algorithm." Information and Computation 275 (December 2020): 104605. http://dx.doi.org/10.1016/j.ic.2020.104605.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nathanson, Michael. "Quantum guessing via Deutsch-Jozsa." Quantum Information and Computation 10, no. 9&10 (2010): 837–47. http://dx.doi.org/10.26421/qic10.9-10-9.

Full text
Abstract:
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover the identity of two objects from a known finite set $\Omega$ by asking yes/no questions. The best known classical algorithm requires $O(\log N)$ questions and $O(\log^2 N)$ steps to process the answers, where $N = \vert \Omega \vert$. We apply the Deutsch-Jozsa algorithm and show that the number of necessary calls to the oracle is independent of the size of the domain and that the output from each run of the algorithm has immediate meaning. In doing so, we extend the types of questions that
APA, Harvard, Vancouver, ISO, and other styles
3

Brazier, A., and M. B. Plenio. "Broken promises and quantum algorithms." Quantum Information and Computation 5, no. 2 (2005): 131–45. http://dx.doi.org/10.26421/qic5.2-4.

Full text
Abstract:
In the black-box model, problems constrained by a "promise" are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa algorithm. More recently, Wim van Dam put forward an algorithm for unstrucred problems (i.e., those without a promise). We consider the Deutsch-Jozsa algorithm with a less restrictive (or "broken") promise and study the transition to an unstructured problem. We compare this to the success of van Dam's algorithm. These are both compared with a standard classic
APA, Harvard, Vancouver, ISO, and other styles
4

Heydari, H., and G. Bjork. "Entanglement tensor for a general pure multipartite quantum state." Quantum Information and Computation 5, no. 2 (2005): 146–56. http://dx.doi.org/10.26421/qic5.2-5.

Full text
Abstract:
In the black-box model, problems constrained by a `promise' are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa algorithm. More recently, Wim van Dam put forward an algorithm for unstructured problems (i.e., those without a promise). We consider the Deutsch-Jozsa algorithm with a less restrictive (or `broken') promise and study the transition to an unstructured problem. We compare this to the success of van Dam's algorithm. These are both compared with a standard class
APA, Harvard, Vancouver, ISO, and other styles
5

Paredes López, M., A. Meneses Viveros, and G. Morales-Luna. "Algoritmo cuántico de Deutsch y Jozsa en GAMA." Revista Mexicana de Física E 64, no. 2 (2018): 181. http://dx.doi.org/10.31349/revmexfise.64.181.

Full text
Abstract:
An important feature of quantum computing is its inherent paralellism, allowing to process an exponential number of basic transforms with just a linear number of qubits. The Deutsch-Jozsa algorithm exemplifies the computational complexity reduction. This work reports the implementation and execution of the Deutsch-Josza quantum algoritm in GAMA, a programming language for quantum computing simulation developed by ourselves. Through this simulation, it is possible to explore all the components involved by tracing all the different configurations that each component may take.
APA, Harvard, Vancouver, ISO, and other styles
6

Miano, Mariana Godoy Vazquez, Lucas Gomes Pinheiro, Sthefanie Costa Amaro, and Victor Luis Rodrigues Pereira Ferreira. "COMPARAÇÃO DE DESEMPENHO DO ALGORITMO DE DEUTSCH-JOZSA NAS LINGUAGENS QUÂNTICAS SILQ E QASM." REVISTA TECNOLÓGICA DA FATEC AMERICANA 11, no. 01 (2023): 47–67. http://dx.doi.org/10.47283/244670492023110147.

Full text
Abstract:
Due to the importance given to information in the last few decades, a performance and processing advantage of information becomes relevant, something that can be found through quantum computing. The Deutsch-Jozsa Algorithm is the first example of a quantum algorithm that offers an exponential advantage against classical algorithms, whether in a local environment or through cloud simulators. Seeking to explore the advantages of quantum computation, the Deutsch-Jozsa Algorithm was implemented in two quantum programming languages, namely the high level language Silq, focused on the execution of t
APA, Harvard, Vancouver, ISO, and other styles
7

Cheng, Kaiyang, Weixuan Zhang, Zeyong Wei, et al. "Simulate Deutsch-Jozsa algorithm with metamaterials." Optics Express 28, no. 11 (2020): 16230. http://dx.doi.org/10.1364/oe.393444.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

DONG, PING, XIAO-HU ZHENG, and ZHUO-LIANG CAO. "IMPLEMENTATION OF ONE-QUBIT DEUTSCH–JOZSA ALGORITHM IN A TRIPLE-WELL SEMICONDUCTOR QUANTUM DOT SYSTEM." Modern Physics Letters B 22, no. 24 (2008): 2383–89. http://dx.doi.org/10.1142/s0217984908016789.

Full text
Abstract:
A physical scheme for implementing the one-qubit Deutsch–Jozsa algorithm by electronic population adiabatic transfer in a triple-well quantum dot system is proposed. The scheme is relatively insensitive to gate errors and other external noise. Furthermore, the implementation of Deutsch–Jozsa algorithm via the quantum dot system provides a good example for oracle-based solid quantum computing.
APA, Harvard, Vancouver, ISO, and other styles
9

ZHENG, XIAO-HU, MING YANG, PING DONG, and ZHUO-LIANG CAO. "IMPLEMENTING DEUTSCH–JOZSA ALGORITHM USING SUPERCONDUCTING QUBIT NETWORK." Modern Physics Letters B 22, no. 31 (2008): 3035–42. http://dx.doi.org/10.1142/s0217984908017540.

Full text
Abstract:
An improved architecture, which performs a universal set of gates by current biasing of coupling Josephson junction, has been proposed. This improvement is necessary to the realization of a functional and scalable quantum computer. The proposed architecture is in line with current technology. Secondly, we investigate a scheme for implementing the Deutsch–Jozsa algorithm via the improved architecture. It is a simple, scalable and feasible scheme for the implementation of the Deutsch–Jozsa algorithm based on the current-controlled superconducting charge qubit network.
APA, Harvard, Vancouver, ISO, and other styles
10

Batty, Michael, Andrew J. Duncan, and Samuel L. Braunstein. "Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups." LMS Journal of Computation and Mathematics 9 (2006): 40–63. http://dx.doi.org/10.1112/s1461157000001182.

Full text
Abstract:
AbstractHøyer has given a generalisation of the Deutsch–Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch–Jozsa–Høyer algorithm) can in fact deal with a broader range of promises, which we define in terms of the irreducible representations of G.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Deutsch Jozsa Algorithm"

1

Floether, Frederik. "Development of SiOxNy waveguides for integrated quantum photonics." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/253107.

Full text
Abstract:
The development of integrated quantum photonics is integral to many areas of quantum information science, in particular linear optical quantum computing. In this context, a diversity of physical systems is being explored and thus versatility and adaptability are important prerequisites for any candidate platform. Silicon oxynitride is a promising material because its refractive index can be varied over a wide range. This dissertation describes the development of silicon oxynitride waveguides for applications in the field of integrated quantum photonics. The project consisted of three stages: d
APA, Harvard, Vancouver, ISO, and other styles
2

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Full text
Abstract:
<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro
APA, Harvard, Vancouver, ISO, and other styles
3

Nyman, Peter. "On relations between classical and quantum theories of information and probability." Doctoral thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-13830.

Full text
Abstract:
In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was  introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometri
APA, Harvard, Vancouver, ISO, and other styles
4

Gopinath, T. "Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms." Thesis, 2007. https://etd.iisc.ac.in/handle/2005/1078.

Full text
Abstract:
The progess in NMRQIP can be outlined in to four parts.1) Implementation of theoretical protocols on small number of qubits. 2) Demonstration of QIP on various NMR systems. 3) Designing and implementing the algorithms for mixed initial states. 4) Developing the techniques for coherent and decoherent control on higher number(up to 15) of qubits. This thesis contains some efforts in the direction of first three points. Quantum-state discrimination has important applications in the context of quantum communication and quantum cryptography. One of the characteristic features of quantum mechanic
APA, Harvard, Vancouver, ISO, and other styles
5

Gopinath, T. "Quantum Information Processing By NMR : Quantum State Discrimination, Hadamard Spectroscopy, Liouville Space Search, Use Of Geometric Phase For Gates And Algorithms." Thesis, 2007. http://hdl.handle.net/2005/1078.

Full text
Abstract:
The progess in NMRQIP can be outlined in to four parts.1) Implementation of theoretical protocols on small number of qubits. 2) Demonstration of QIP on various NMR systems. 3) Designing and implementing the algorithms for mixed initial states. 4) Developing the techniques for coherent and decoherent control on higher number(up to 15) of qubits. This thesis contains some efforts in the direction of first three points. Quantum-state discrimination has important applications in the context of quantum communication and quantum cryptography. One of the characteristic features of quantum mechanics
APA, Harvard, Vancouver, ISO, and other styles
6

Ghosh, Arindam. "Quantum Information Processing By NMR : Relaxation Of Pseudo Pure States, Geometric Phases And Algorithms." Thesis, 2006. https://etd.iisc.ac.in/handle/2005/454.

Full text
Abstract:
This thesis focuses on two aspects of Quantum Information Processing (QIP) and contains experimental implementation by Nuclear Magnetic Resonance (NMR) spectroscopy. The two aspects are: (i) development of novel methodologies for improved or fault tolerant QIP using longer lived states and geometric phases and (ii) implementation of certain quantum algorithms and theorems by NMR. In the first chapter a general introduction to Quantum Information Processing and its implementation using NMR as well as a description of NMR Hamiltonians and NMR relaxation using Redfield theory and magnetization
APA, Harvard, Vancouver, ISO, and other styles
7

Ghosh, Arindam. "Quantum Information Processing By NMR : Relaxation Of Pseudo Pure States, Geometric Phases And Algorithms." Thesis, 2006. http://hdl.handle.net/2005/454.

Full text
Abstract:
This thesis focuses on two aspects of Quantum Information Processing (QIP) and contains experimental implementation by Nuclear Magnetic Resonance (NMR) spectroscopy. The two aspects are: (i) development of novel methodologies for improved or fault tolerant QIP using longer lived states and geometric phases and (ii) implementation of certain quantum algorithms and theorems by NMR. In the first chapter a general introduction to Quantum Information Processing and its implementation using NMR as well as a description of NMR Hamiltonians and NMR relaxation using Redfield theory and magnetization m
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Deutsch Jozsa Algorithm"

1

Baaquie, Belal Ehsan, and Leong-Chuan Kwek. "Deutsch–Jozsa Algorithm." In Quantum Computers. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7517-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hooyberghs, Johnny. "Deutsch-Jozsa Algorithm." In Introducing Microsoft Quantum Computing for Developers. Apress, 2021. http://dx.doi.org/10.1007/978-1-4842-7246-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Arodz, Tomasz. "Generalized Quantum Deutsch-Jozsa Algorithm." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-50433-5_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Hao, Daowen Qiu, and Le Luo. "Distributed Generalized Deutsch-Jozsa Algorithm." In Lecture Notes in Computer Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-1093-8_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pati, Arun K., and Samuel L. Braunstein. "Deutsch-Jozsa Algorithm for Continuous Variables." In Quantum Information with Continuous Variables. Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-015-1258-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ballhysa, Elton, and Ahmet Celal Cem Say. "Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30182-0_97.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Batty, Michael, Andrea Casaccino, Andrew J. Duncan, Sarah Rees, and Simone Severini. "An Application of the Deutsch-Jozsa Algorithm to Formal Languages and the Word Problem in Groups." In Theory of Quantum Computation, Communication, and Cryptography. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89304-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

SAPV, Tharrmashastha, Debajyoti Bera, Arpita Maitra, and Subhamoy Maitra. "Deutsch-Jozsa and Walsh Spectrum." In Quantum Algorithms for Cryptographically Significant Boolean Functions. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-3061-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Silva, Vladimir. "Quantum Advantage with Deutsch-Jozsa, Bernstein-Vazirani, and Simon’s Algorithms." In Quantum Computing by Practice. Apress, 2023. http://dx.doi.org/10.1007/978-1-4842-9991-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rau, Jochen. "Computation." In Quantum Theory. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192896308.003.0004.

Full text
Abstract:
This chapter introduces the basic building blocks of quantum computing and a variety of specific algorithms. It begins with a brief review of classical computing and discusses how its key elements – bits, gates, circuits – carry over to the quantum realm. It highlights crucial differences to the classical case, such as the impossibility of copying a qubit. The quantum circuit model is shown to be universal, and a peculiar variant of quantum computing, based on measurements only, is illustrated. That a quantum computer can perform some calculations more efficiently than a classical computer, at
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Deutsch Jozsa Algorithm"

1

Kumar, K. Ajay, V. R. Vimal, and V. Karthick. "Error Rate Increment of Quantum Computer using Quantity Computational Algorithm Comparing with Deutsch Jozsa Algorithm." In 2024 OPJU International Technology Conference (OTCON) on Smart Computing for Innovation and Advancement in Industry 4.0. IEEE, 2024. http://dx.doi.org/10.1109/otcon60325.2024.10687882.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nyman, Peter, Guillaume Adenier, Andrei Yu Khrennikov, Pekka Lahti, Vladimir I. Man'ko, and Theo M. Nieuwenhuizen. "Simulation of Deutsch-Jozsa Algorithm in Mathematica." In Quantum Theory. AIP, 2007. http://dx.doi.org/10.1063/1.2827324.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chappidi, Varun, and Soumya Ganguly. "Simulation of NMR implementation of Deutsch-Jozsa algorithm." In 2014 IEEE International Advance Computing Conference (IACC). IEEE, 2014. http://dx.doi.org/10.1109/iadcc.2014.6779431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bianucci, Pablo, Andreas Muller, Chih-Kang Shih, Qu-Quan Wang, Qi-Kun Xue, and Carlo Piermaroc. "Single qubit Deutsch-Jozsa algorithm in a quantum dot." In International Quantum Electronics Conference. OSA, 2004. http://dx.doi.org/10.1364/iqec.2004.itui6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Blackwell, Ashley N., Riad Yahiaoui, Yi-Huan Chen, et al. "Quantum Algorithm Emulator for Implementation of Deutsch-Jozsa Algorithm in the THz region." In 2023 48th International Conference on Infrared, Millimeter, and Terahertz Waves (IRMMW-THz). IEEE, 2023. http://dx.doi.org/10.1109/irmmw-thz57677.2023.10298887.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fan, Yale. "A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic." In 37th International Symposium on Multiple-Valued Logic. IEEE, 2007. http://dx.doi.org/10.1109/ismvl.2007.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Scholz, Matthias, Sven Ramelow, Oliver Benson, and Thomas Aichele. "Deutsch-Jozsa algorithm using triggered single photons from a single quantum dot." In 2006 Conference on Lasers and Electro-Optics and 2006 Quantum Electronics and Laser Science Conference. IEEE, 2006. http://dx.doi.org/10.1109/cleo.2006.4629027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

De, Rohit, Raymond Moberly, Colton Beery, Jeremy Juybari, and Kyle Sundqvist. "Multi-Qubit Size-Hopping Deutsch-Jozsa Algorithm with Qubit Reordering for Secure Quantum Key Distribution." In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2021. http://dx.doi.org/10.1109/qce52317.2021.00084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kreinovich, Vladik, Martine Ceberio, and Ricardo Alvarez. "How to Use Quantum Computing to Check Which Inputs Are Relevant: A Proof That Deutsch-Jozsa Algorithm Is, In Effect, the Only Possibility." In 2019 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2019. http://dx.doi.org/10.1109/ssci44817.2019.9002709.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Perez-Garcia, Benjamin, Jason Francis, Melanie McLaren, et al. "Implementation of Deutsch and Deutsch-Jozsa algorithms with classical light." In SPIE Optical Engineering + Applications, edited by Andrew Forbes and Todd E. Lizotte. SPIE, 2016. http://dx.doi.org/10.1117/12.2238271.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Deutsch Jozsa Algorithm' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography