Log in

Relevant bibliographies by topics / Quantum Computation,Quantum Circuit,Boolean Circuit / Journal articles

To see the other types of publications on this topic, follow the link: Quantum Computation,Quantum Circuit,Boolean Circuit.

Journal articles on the topic 'Quantum Computation,Quantum Circuit,Boolean Circuit'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Quantum Computation,Quantum Circuit,Boolean Circuit.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Jung, Jihye, and In-Chan Choi. "A multi-commodity network model for optimal quantum reversible circuit synthesis." PLOS ONE 16, no. 6 (2021): e0253140. http://dx.doi.org/10.1371/journal.pone.0253140.

Full text

Abstract:

Quantum computing is a newly emerging computing environment that has recently attracted intense research interest in improving the output fidelity, fully utilizing its high computing power from both hardware and software perspectives. In particular, several attempts have been made to reduce the errors in quantum computing algorithms through the efficient synthesis of quantum circuits. In this study, we present an application of an optimization model for synthesizing quantum circuits with minimum implementation costs to lower the error rates by forming a simpler circuit. Our model has a unique

APA, Harvard, Vancouver, ISO, and other styles

2

Gao, Peng, Yiwei Li, Marek Perkowski, and Xiaoyu Song. "Realization of Quantum Oracles using Symmetries of Boolean Functions." Quantum Information and Computation 20, no. 5&6 (2020): 418–48. http://dx.doi.org/10.26421/qic20.5-6-4.

Full text

Abstract:

Designing a quantum oracle is an important step in practical realization of Grover algorithm, therefore it is useful to create methodologies to design oracles. Lattice diagrams are regular two-dimensional structures that can be directly mapped onto a quantum circuit. We present a quantum oracle design methodology based on lattices. The oracles are designed with a proposed method using generalized Boolean symmetric functions realized with lattice diagrams. We also present a decomposition-based algorithm that transforms non-symmetric functions into symmetric or partially symmetric functions. Our

APA, Harvard, Vancouver, ISO, and other styles

3

Kannan, R., and K. Vidhya. "Design of Combinational Circuits Using Reversible Decoder in Tanner Tools." Journal of Computational and Theoretical Nanoscience 17, no. 4 (2020): 1743–51. http://dx.doi.org/10.1166/jctn.2020.8436.

Full text

Abstract:

Reversible logic is the emerging field for research in present era. The aim of this paper is to realize different types of combinational circuits like full-adder, full-subtractor, multiplexer and comparator using reversible decoder circuit with minimum quantum cost. Reversible decoder is designed using Fredkin gates with minimum Quantum cost. There are many reversible logic gates like Fredkin Gate, Feynman Gate, Double Feynman Gate, Peres Gate, Seynman Gate and many more. Reversible logic is defined as the logic in which the number output lines are equal to the number of input lines i.e., the

APA, Harvard, Vancouver, ISO, and other styles

4

Dehghan, E., D. Sanavi Khoshnoud, and A. S. Naeimi. "NAND/AND/NOT logic gates response in series of mesoscopic quantum rings." Modern Physics Letters B 33, no. 34 (2019): 1950431. http://dx.doi.org/10.1142/s0217984919504311.

Full text

Abstract:

There is a special class of logic gates, called universal gates, any one of which is sufficient to express any desired computation. The NAND gate is truly global, given that it is already known, each Boolean function can be represented in a circuit that contains only NOT and AND gates, it is sufficient to show that these gates can be defined from the NAND gate. The effect of Rashba spin-orbit interaction (SOI) on the gate response and spin current density in a series of non-interacting one-dimensional rings connected to some leads is studied theoretically within the waveguide theory. The gates

APA, Harvard, Vancouver, ISO, and other styles

5

TERASHIMA, HIROAKI, and MASAHITO UEDA. "NONUNITARY QUANTUM CIRCUIT." International Journal of Quantum Information 03, no. 04 (2005): 633–47. http://dx.doi.org/10.1142/s0219749905001456.

Full text

Abstract:

A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, and all one-qubit unitary gates constitute a universal set of gates for the nonunitary quantum circuit, without the necessity of introducing ancilla qubits. A reversing measurement scheme is used to improve the probability of successful nonunitary gate operation. A quantum NAND gate and Abrams–Lloyd's nonlinear gate are analyzed as examples. Our nonunitary circuit can be used to red

APA, Harvard, Vancouver, ISO, and other styles

6

Van den Nest, Maarten. "Quantum matchgate computations and linear threshold gates." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467, no. 2127 (2010): 821–40. http://dx.doi.org/10.1098/rspa.2010.0332.

Full text

Abstract:

The theory of matchgates is of interest in various areas in physics and computer science. Matchgates occur, for example, in the study of fermions and spin chains, in the theory of holographic algorithms and in several recent works in quantum computation. In this paper, we completely characterize the class of Boolean functions computable by unitary two-qubit matchgate circuits with some probability of success. We show that this class precisely coincides with that of the linear threshold gates . The latter is a fundamental family that appears in several fields, such as the study of neural networ

APA, Harvard, Vancouver, ISO, and other styles

7

Al‐Rabadi, Anas N., and Martin Zwick. "Reversible modified reconstructability analysis of Boolean circuits and its quantum computation." Kybernetes 33, no. 5/6 (2004): 921–32. http://dx.doi.org/10.1108/03684920410533976.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chabi, Amir Mokhtar, Samira Sayedsalehi, Shaahin Angizi, and Keivan Navi. "Efficient QCA Exclusive-or and Multiplexer Circuits Based on a Nanoelectronic-Compatible Designing Approach." International Scholarly Research Notices 2014 (October 16, 2014): 1–9. http://dx.doi.org/10.1155/2014/463967.

Full text

Abstract:

Quantum-dot cellular automata (QCA) are a transistorless computation approach which encodes binary information via configuration of charges among quantum dots. The fundamental QCA logic primitives are majority and inverter gates which can be utilized to design various QCA circuits. This study presents a novel approach to designing efficient QCA-based circuits based on Boolean expressions achieved from reconfiguration of five-input and three-input majority gates. Whereas the multiplexer and Exclusive-or are the most important fundamental logical circuits in digital systems, designing efficient

APA, Harvard, Vancouver, ISO, and other styles

9

Vlachos, Panagiotis, and Ioannis G. Karafyllidis. "Quantum game simulator, using the circuit model of quantum computation." Computer Physics Communications 180, no. 10 (2009): 1990–98. http://dx.doi.org/10.1016/j.cpc.2009.05.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sousa, P. B. M., and R. V. Ramos. "Universal quantum circuit for n-qubit quantum gate: a programmable quantum gate." Quantum Information and Computation 7, no. 3 (2007): 228–42. http://dx.doi.org/10.26421/qic7.3-4.

Full text

Abstract:

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ

APA, Harvard, Vancouver, ISO, and other styles

11

Ulyanov, Sergey, Andrey Reshetnikov, Olga Tyatyushkina, and Vladimir Korenkov. "Quantum software engineering. Pt. I: Quantum Circuit (Gate) Model based Computing – education Lectures and pedagogical workshop." System Analysis in Science and Education, no. 3 (2020) (September 30, 2020): 129–201. http://dx.doi.org/10.37005/2071-9612-2020-3-129-201.

Full text

Abstract:

All the quantum algorithms are based on a certain quantum computing model, varying from the quantum circuit, one-way quantum computation, adiabatic quantum computation and topological quantum computation. These four models are equivalent in computational power; among them, the quantum circuit model is most frequently used. In the circuit model, it has been proved that arbitrary single-qubit rotations plus twoqubit controlled-NOT gates are universal, i.e. they can provide a set of gates to implement any quantum algorithm. This article discusses the goal for this research: it is to given a light

APA, Harvard, Vancouver, ISO, and other styles

12

Karafyllidis, I. G. "Quantum computer simulator based on the circuit model of quantum computation." IEEE Transactions on Circuits and Systems I: Regular Papers 52, no. 8 (2005): 1590–96. http://dx.doi.org/10.1109/tcsi.2005.851999.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

JI, Y. H., L. XU, B. XU, and Z. S. WANG. "IMPLEMENTATION OF NON-ADIABATIC GEOMETRIC QUANTUM GATE IN QUANTUM CIRCUIT." Modern Physics Letters B 24, no. 08 (2010): 727–33. http://dx.doi.org/10.1142/s0217984910022809.

Full text

Abstract:

A scheme is investigated to realize non-adiabatic geometric quantum computation by directly varying the external parameters of quantum circuit. More intriguingly, we illustrate in detail how to control the parameters of the system to remove the dynamical phase. The scheme depends completely on manipulating both the circuit parameters and the magnetic field parameters, which does not require any rotation operation as done in the conventional geometric gates or the unconventional geometric gates.

APA, Harvard, Vancouver, ISO, and other styles

14

TSAI, I.-MING, and SY-YEN KUO. "AN ALGORITHM FOR MINIMUM SPACE QUANTUM BOOLEAN CIRCUITS CONSTRUCTION." Journal of Circuits, Systems and Computers 15, no. 05 (2006): 719–38. http://dx.doi.org/10.1142/s0218126606003349.

Full text

Abstract:

Implementing a quantum computer at the circuit level has emerged as an important field of research recently. An important topic of building a general-purpose quantum computer is to implement classical Boolean logic using quantum gates and devices. Since the Toffoli gate is universal in classical Boolean logic, any classical combinational circuit can be implemented by the straightforward replacement algorithm with auxiliary qubits as intermediate storage. However, this inefficient implementation causes a large number of auxiliary qubits to be used. In this paper, a systematic procedure is propo

APA, Harvard, Vancouver, ISO, and other styles

15

Agrawal, Nishant. "Automatic Test Pattern Generation using Grover’s Algorithm." International Journal for Research in Applied Science and Engineering Technology 9, no. VI (2021): 2373–79. http://dx.doi.org/10.22214/ijraset.2021.34837.

Full text

Abstract:

Quantum computing is an exciting new field in the intersection of computer science, physics and mathematics. It refines the central concepts from Quantum mechanics into its least difficult structures, peeling away the complications from the physical world. Any combinational circuit that has only one stuck at fault can be tested by applying a set of inputs that drive the circuit to verify the output response. The outputs of that circuit will be different from the one desired if the faults exist. This project describes a method of generating test patterns using the Boolean satisfaction method. F

APA, Harvard, Vancouver, ISO, and other styles

16

Larasati, Harashta Tatimma, Asep Muhamad Awaludin, Janghyun Ji, and Howon Kim. "Quantum Circuit Design of Toom 3-Way Multiplication." Applied Sciences 11, no. 9 (2021): 3752. http://dx.doi.org/10.3390/app11093752.

Full text

Abstract:

In classical computation, Toom–Cook is one of the multiplication methods for large numbers which offers faster execution time compared to other algorithms such as schoolbook and Karatsuba multiplication. For the use in quantum computation, prior work considered the Toom-2.5 variant rather than the classically faster and more prominent Toom-3, primarily to avoid the nontrivial division operations inherent in the latter circuit. In this paper, we investigate the quantum circuit for Toom-3 multiplication, which is expected to give an asymptotically lower depth than the Toom-2.5 circuit. In partic

APA, Harvard, Vancouver, ISO, and other styles

17

Pershin, Yuriy V., and Massimiliano Di Ventra. "Neuromorphic, Digital, and Quantum Computation With Memory Circuit Elements." Proceedings of the IEEE 100, no. 6 (2012): 2071–80. http://dx.doi.org/10.1109/jproc.2011.2166369.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

DALLA CHIARA, MARIA LUISA, ROBERTO GIUNTINI, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 02 (2005): 293–337. http://dx.doi.org/10.1142/s0219749905000943.

Full text

Abstract:

The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister (a system of qubits) or, more generally, with a mixture of quregisters (called qumix). In this framework, any sentence α of the language gives rise to a quantum tree: a kind of quantum circuit that transforms the quregister (qumix) associated to the atomic subformulas of α into the quregister (qumix) associated to α. A variant of the quantum computational semantics is

APA, Harvard, Vancouver, ISO, and other styles

19

Mondal, Joyati, Bappaditya Mondal, Dipak Kumar Kole, Hafizur Rahaman, and Debesh Kumar Das. "Boolean Difference Technique for Detecting All Missing Gate and Stuck-at Faults in Reversible Circuits." Journal of Circuits, Systems and Computers 28, no. 12 (2019): 1950212. http://dx.doi.org/10.1142/s0218126619502128.

Full text

Abstract:

Quantum reversible circuit is a new emerging technology attracting the researchers. A reversible circuit is composed of reversible gates. One example of reversible gate is Toffoli gate. A Toffoli gate (also known as [Formula: see text]-CNOT) has two components — the control and the target. Initially, stuck-at fault and other fault models were used for modeling defects in quantum reversible circuits. Later, a new fault model known as missing gate fault model was introduced, which is more effective in capturing the errors in quantum reversible circuit. Boolean Difference is already a known techn

APA, Harvard, Vancouver, ISO, and other styles

20

Pan, Naiqiao, Tian Chen, Houjun Sun, and Xiangdong Zhang. "Electric-Circuit Realization of Fast Quantum Search." Research 2021 (July 26, 2021): 1–8. http://dx.doi.org/10.34133/2021/9793071.

Full text

Abstract:

Quantum search algorithm, which can search an unsorted database quadratically faster than any known classical algorithms, has become one of the most impressive showcases of quantum computation. It has been implemented using various quantum schemes. Here, we demonstrate both theoretically and experimentally that such a fast search algorithm can also be realized using classical electric circuits. The classical circuit networks to perform such a fast search have been designed. It has been shown that the evolution of electric signals in the circuit networks is analogies of quantum particles random

APA, Harvard, Vancouver, ISO, and other styles

21

Houshmand, Mahboobeh, Mehdi Sedighi, Morteza Saheb Zamani, and Kourosh Marjoei. "Quantum Circuit Synthesis Targeting to Improve One-Way Quantum Computation Pattern Cost Metrics." ACM Journal on Emerging Technologies in Computing Systems 13, no. 4 (2017): 1–27. http://dx.doi.org/10.1145/3064834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

YOUNES, AHMED. "REDUCING QUANTUM COST OF REVERSIBLE CIRCUITS FOR HOMOGENEOUS BOOLEAN FUNCTIONS." Journal of Circuits, Systems and Computers 19, no. 07 (2010): 1423–34. http://dx.doi.org/10.1142/s0218126610006736.

Full text

Abstract:

Homogeneous Boolean functions have many applications in computing systems, e.g., cryptography. This paper presents a factorization algorithm for reducing the quantum cost of the reversible circuits for that class of Boolean functions. The algorithm reduces the multi-calculation of any common parts of the circuit. This allows Homogeneous Boolean related applications to be implemented efficiently on novel computing paradigms such as quantum computers and low power devices.

APA, Harvard, Vancouver, ISO, and other styles

23

Ulyanov, Sergey, Andrey Reshetnikov, and Olga Tyatyushkina. "Modelling of Grover’s quantum search algorithms: implementations of Simple quantum simulators on classical computers." System Analysis in Science and Education, no. 3 (2020) (September 30, 2020): 65–128. http://dx.doi.org/10.37005/2071-9612-2020-3-65-128.

Full text

Abstract:

Models of Grover’s search algorithm is reviewed to build the foundation for the other algorithms. Thereafter, some preliminary modifications of the original algorithms by others are stated, that increases the applicability of the search procedure. A general quantum computation on an isolated system can be represented by a unitary matrix. In order to execute such a computation on a quantum computer, it is common to decompose the unitary into a quantum circuit, i.e., a sequence of quantum gates that can be physically implemented on a given architecture. There are different universal gate sets fo

APA, Harvard, Vancouver, ISO, and other styles

24

Zomorodi-Moghadam, Mariam, and Keivan Navi. "Rotation-Based Design and Synthesis of Quantum Circuits." Journal of Circuits, Systems and Computers 25, no. 12 (2016): 1650152. http://dx.doi.org/10.1142/s0218126616501528.

Full text

Abstract:

In this paper, a new synthesis method for Boolean irreversible functions has been proposed which is based on rotation quantum operators. The primary motivation is that the implementation of these operators is commonly available in quantum technologies. We introduce an approach for synthesizing Boolean irreversible functions in quantum logic which is based on quantum rotation and CNOT operators and uses a prespecified fixed design where by changing the rotation angles a new functionality can be achieved. So this design can be viewed as a programmable array of rotation gates. If reduction in qua

APA, Harvard, Vancouver, ISO, and other styles

25

McKAGUE, MATTHEW. "ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES." International Journal of Quantum Information 11, no. 01 (2013): 1350001. http://dx.doi.org/10.1142/s0219749913500019.

Full text

Abstract:

We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well known that a quantum circuit over the complex numbers can be transformed into a quantum circuit over the real numbers with the addition of a single qubit. This implies that BQP retains its power when restricted to using states and operations over the reals. We show that the same is true for QMA (k), QIP (k), QMIP and QSZK.

APA, Harvard, Vancouver, ISO, and other styles

26

Hayden, Patrick, Kevin Milner, and Mark M. Wilde. "Two-message quantum interactive proofs and the quantum separability problem." Quantum Information and Computation 14, no. 5&6 (2014): 384–416. http://dx.doi.org/10.26421/qic14.5-6-2.

Full text

Abstract:

Suppose that a polynomial-time mixed-state quantum circuit, described as a sequence of local unitary interactions followed by a partial trace, generates a quantum state shared between two parties. One might then wonder, does this quantum circuit produce a state that is separable or entangled? Here, we give evidence that it is computationally hard to decide the answer to this question, even if one has access to the power of quantum computation. We begin by exhibiting a two-message quantum interactive proof system that can decide the answer to a promise version of the question. We then prove tha

APA, Harvard, Vancouver, ISO, and other styles

27

MARZUOLI, ANNALISA, and MARIO RASETTI. "SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 01 (2005): 65–72. http://dx.doi.org/10.1142/s0219749905000499.

Full text

Abstract:

The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFTs). The key tool is provided by the fiber space structure underlying the model which exhibits combinatorial properties closely related to SU (2) state sum models, widely employed in discretizing TQFTs and quantum gravity in low spacetime dimensions.

APA, Harvard, Vancouver, ISO, and other styles

28

Kissinger, Aleks, and Arianne Meijer van de Griend. "CNOT circuit extraction for topologically-constrained quantum memories." Quantum Information and Computation 20, no. 7&8 (2020): 581–96. http://dx.doi.org/10.26421/qic20.7-8-4.

Full text

Abstract:

Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours in a lattice or graph structure. Hence, before a computation can be run on such a device, it must be mapped onto the physical architecture. That is, logical qubits must be assigned physical locations in the quantum memory, and the circuit must be replaced by an equivalent one containing only operations between nearest neighbours. In this paper, we give a new technique for quantum circuit mapping (a.k.a. routing), ba

APA, Harvard, Vancouver, ISO, and other styles

29

Gottesman, Daniel. "Fault-Tolerant quantum computation with constant overhead." Quantum Information and Computation 14, no. 15&16 (2014): 1339–71. http://dx.doi.org/10.26421/qic14.15-16-5.

Full text

Abstract:

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.

APA, Harvard, Vancouver, ISO, and other styles

30

Ntalaperas, Dimitrios, Konstantinos Giannakis, and Nikos Konofaos. "A Quantum Cellular Automata Type Architecture with Quantum Teleportation for Quantum Computing." Entropy 21, no. 12 (2019): 1235. http://dx.doi.org/10.3390/e21121235.

Full text

Abstract:

We propose an architecture based on Quantum Cellular Automata which allows the use of only one type of quantum gate per computational step, using nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single-qubit operations and continuing with two-qubit ones. A demonstration of the model is given, by analyzing how the techniques can be used to design a circuit implementing the Quantum Fourier Transform. Since the model uses only one type of quantum gate at each phase of the computation, physical implemen

APA, Harvard, Vancouver, ISO, and other styles

31

Frunzio, L., A. Wallraff, D. Schuster, J. Majer, and R. Schoelkopf. "Fabrication and Characterization of Superconducting Circuit QED Devices for Quantum Computation." IEEE Transactions on Appiled Superconductivity 15, no. 2 (2005): 860–63. http://dx.doi.org/10.1109/tasc.2005.850084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Higgott, Oscar, Daochen Wang, and Stephen Brierley. "Variational Quantum Computation of Excited States." Quantum 3 (July 1, 2019): 156. http://dx.doi.org/10.22331/q-2019-07-01-156.

Full text

Abstract:

The calculation of excited state energies of electronic structure Hamiltonians has many important applications, such as the calculation of optical spectra and reaction rates. While low-depth quantum algorithms, such as the variational quantum eigenvalue solver (VQE), have been used to determine ground state energies, methods for calculating excited states currently involve the implementation of high-depth controlled-unitaries or a large number of additional samples. Here we show how overlap estimation can be used to deflate eigenstates once they are found, enabling the calculation of excited s

APA, Harvard, Vancouver, ISO, and other styles

33

Van den Nest, M. "Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond." Quantum Information and Computation 10, no. 3&4 (2010): 258–71. http://dx.doi.org/10.26421/qic10.3-4-6.

Full text

Abstract:

We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques. The normal form highlights why Clifford circuits have such limited computational power in spite of their high entangling power. At the same time, the normal form shows how the classical simulation of Clifford circuits fits into the standard way of embedding classical compu

APA, Harvard, Vancouver, ISO, and other styles

34

TRISETYARSO, AGUNG, and RODNEY VAN METER. "CIRCUIT DESIGN FOR A MEASUREMENT-BASED QUANTUM CARRY-LOOKAHEAD ADDER." International Journal of Quantum Information 08, no. 05 (2010): 843–67. http://dx.doi.org/10.1142/s0219749910006496.

Full text

Abstract:

We present the design and evaluation of a quantum carry-lookahead adder (QCLA) using measurement-based quantum computation (MBQC), called MBQCLA. QCLA was originally designed for an abstract, concurrent architecture supporting long-distance communication, but most realistic architectures heavily constrain communication distances. The quantum carry-lookahead adder is faster than a quantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. MBQCLA utilizes MBQC's ability to transfer quantum states in unit time to accelerate addition. MBQCLA breaks the latency li

APA, Harvard, Vancouver, ISO, and other styles

35

Latorre, Jose I., and German Sierra. "Quantum computation of prime number functions." Quantum Information and Computation 14, no. 7&8 (2014): 577–88. http://dx.doi.org/10.26421/qic14.7-8-3.

Full text

Abstract:

We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than $2^n$, where $n$ is the number of qubits of the register. This Prime state can be built using Grover's algorithm, whose oracle is a quantum implementation of the classical Miller-Rabin primality test. The Prime state is highly entangled, and its entanglement measures encode number theoretical functions such as the distribution of twin primes or the Chebyshev bias. This algorithm can be further combined with the quantum Fourier transform to yield an estimate of the pr

APA, Harvard, Vancouver, ISO, and other styles

36

Souza, A. M., A. Gavini-Viana, I. S. Oliveira, et al. "Nuclear spin $3/2$ electric quadrupole relaxation as a quantum computation process." Quantum Information and Computation 10, no. 7&8 (2010): 653–68. http://dx.doi.org/10.26421/qic10.7-8-6.

Full text

Abstract:

In this work we applied a quantum circuit treatment to describe the nuclear spin relaxation. From the Redfield theory, we obtain a description of the quadrupolar relaxation as a computational process in a spin 3/2 system, through a model in which the environment is comprised by five qubits and three different quantum noise channels. The interaction between the environment and the spin 3/2 nuclei is described by a quantum circuit fully compatible with the Redfield theory of relaxation. Theoretical predictions are compared to experimental data, a short review of quantum channels and relaxation i

APA, Harvard, Vancouver, ISO, and other styles

37

Brandao, Fernando G. S. L., and Michal Horodecki. "Exponential quantum speed-ups are generic." Quantum Information and Computation 13, no. 11&12 (2013): 901–24. http://dx.doi.org/10.26421/qic13.11-12-1.

Full text

Abstract:

A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect. We prove the result in two steps. In the first, we show that almost any element of an approximate uni

APA, Harvard, Vancouver, ISO, and other styles

38

AL-RABADI, ANAS N. "REVERSIBLE VITERBI ALGORITHM AND ITS CLOSED-SYSTEM Q-DOMAIN CIRCUIT DESIGN AND COMPUTATION." Journal of Circuits, Systems and Computers 18, no. 08 (2009): 1627–49. http://dx.doi.org/10.1142/s0218126609005903.

Full text

Abstract:

Novel convolution-based multiple-stream error-control coding and decoding methods and their corresponding circuits are introduced. The new coding method applies the reversibility property in (1) the convolution-based encoder for multiple-stream error-control encoding and (2) in the new reversible Viterbi decoding algorithm for multiple-stream error-correction decoding. The complete synthesis of quantum circuits for the quantum realization of the new quantum Viterbi cell in the quantum domain (Q-domain) is also introduced, and the associated quantum computing representations and operations are

APA, Harvard, Vancouver, ISO, and other styles

39

Morimae, Tomoyuki. "Measurement-based quantum computation cannot avoid byproducts." International Journal of Quantum Information 12, no. 05 (2014): 1450026. http://dx.doi.org/10.1142/s0219749914500269.

Full text

Abstract:

In the circuit model of quantum computation, a desired unitary gate can be implemented deterministically, whereas in the measurement-based model the unitary gate is implemented up to a byproduct operator. In order to compensate byproducts, following measurement angles must be adjusted, or classical results must be corrected. Such a feed-forwarding requires some classical processing and tuning of the measurement device, which cause the delay of computation and the additional decoherence. We show that if we respect the no-signaling principle, which is one of the most fundamental principles in ph

APA, Harvard, Vancouver, ISO, and other styles

40

Wu, Chao, Mao-Fa Fang, Xing Xiao, Yan-Ling Li, and Shuai Cao. "Distributed quantum computation with superconducting qubit via LC circuit using dressed states." Chinese Physics B 20, no. 2 (2011): 020305. http://dx.doi.org/10.1088/1674-1056/20/2/020305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Kalita, Gunajit, and Navajit Saikia. "Designing reversible arithmetic, logic circuit to implement micro-operation in quantum computation." Journal of Physics: Conference Series 759 (October 2016): 012097. http://dx.doi.org/10.1088/1742-6596/759/1/012097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Chen, Chang-Yong. "Effect of Multiphoton Processes on Geometric Quantum Computation in Superconducting Circuit QED." Communications in Theoretical Physics 58, no. 5 (2012): 649–52. http://dx.doi.org/10.1088/0253-6102/58/5/06.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

VARTIAINEN, JUHA J., ANTTI O. NISKANEN, MIKIO NAKAHARA, and MARTTI M. SALOMAA. "ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES." International Journal of Quantum Information 02, no. 01 (2004): 1–10. http://dx.doi.org/10.1142/s021974990400002x.

Full text

Abstract:

Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e. for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably

APA, Harvard, Vancouver, ISO, and other styles

44

Childs, Andrew M., Dmitri Maslov, Yunseong Nam, Neil J. Ross, and Yuan Su. "Toward the first quantum simulation with quantum speedup." Proceedings of the National Academy of Sciences 115, no. 38 (2018): 9456–61. http://dx.doi.org/10.1073/pnas.1801723115.

Full text

Abstract:

With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, using diverse techniques to tighten error bounds and optimize circuit implementations. Quantum

APA, Harvard, Vancouver, ISO, and other styles

45

Ferrari, Davide, and Michele Amoretti. "Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices." International Journal of Quantum Information 16, no. 08 (2018): 1840006. http://dx.doi.org/10.1142/s0219749918400063.

Full text

Abstract:

Quantum compiling means fast, device-aware implementation of quantum algorithms (i.e. quantum circuits, in the quantum circuit model of computation). In this paper, we present a strategy for compiling IBM Q-aware, low-depth quantum circuits that generate Greenberger–Horne–Zeilinger (GHZ) entangled states. The resulting compiler can replace the QISKit compiler for the specific purpose of obtaining improved GHZ circuits. It is well known that GHZ states have several practical applications, including quantum machine learning. We illustrate our experience in implementing and querying a uniform qua

APA, Harvard, Vancouver, ISO, and other styles

46

Mozyrsky, Dima, Vladimir Privman, and Steven P. Hotaling. "Design of Gates for Quantum Computation: The NOT Gate." International Journal of Modern Physics B 11, no. 18 (1997): 2207–15. http://dx.doi.org/10.1142/s0217979297001143.

Full text

Abstract:

We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first step in the development of this approach. We derive an explicit form of the interaction Hamiltonian corresponding to this gate and analyze its properties. We also discuss general extensions to the case of certain time-dependent interactions which may be useful for practical realization of quantum logic gates.

APA, Harvard, Vancouver, ISO, and other styles

47

MATUTTIS, HANS-GEORG, KURT FISCHER, NOBUYASU ITO, and MASAMICHI ISHIKAWA. "AUXILIARY FIELD METHODS FOR THE SIMULATION OF QUANTUM COMPUTATION CIRCUITS." International Journal of Modern Physics C 13, no. 07 (2002): 917–29. http://dx.doi.org/10.1142/s0129183102003681.

Full text

Abstract:

One obstacle in the simulation of quantum circuits is the high dimension of the Hilbert space. Using auxiliary field decompositions known from many-particle simulation, we can transform the mathematical description of the quantum circuit into a combination low-dimensional product states which can be sampled using Monte Carlo techniques. We demonstrate the method using Simon's algorithm for the detection of the period of a function.

APA, Harvard, Vancouver, ISO, and other styles

48

Yang, Jie, Wei Zhou, Xiang Li, Jie Wu, and Su Jing Xia. "A Circuit Model of Quantum Cascade Laser Based on a Numerical Analysis." Advanced Materials Research 490-495 (March 2012): 61–65. http://dx.doi.org/10.4028/www.scientific.net/amr.490-495.61.

Full text

Abstract:

Based on the dynamic analysis and numerical computation of quantum cascade laser(QCL), a simple equivalent circuit model of QCL was established, in which we considered the spontaneous emission effect for QCL's start delay. The direct current(DC), transient and frequency response characteristics of QCL were obtained by means of the circuit simulation of PSPICE program, and some relevant parameters that may affect the QCL performance have been analyzed. The results of simulation are consistent with that of numerical calculation in previous literatures.

APA, Harvard, Vancouver, ISO, and other styles

49

Bausch, Johannes, and Elizabeth Crosson. "Analysis and limitations of modified circuit-to-Hamiltonian constructions." Quantum 2 (September 19, 2018): 94. http://dx.doi.org/10.22331/q-2018-09-19-94.

Full text

Abstract:

Feynman's circuit-to-Hamiltonian construction connects quantum computation and ground states of many-body quantum systems. Kitaev applied this construction to demonstrate QMA-completeness of the local Hamiltonian problem, and Aharanov et al. used it to show the equivalence of adiabatic computation and the quantum circuit model. In this work, we analyze the low energy properties of a class of modified circuit Hamiltonians, which include features like complex weights and branching transitions. For history states with linear clocks and complex weights, we develop a method for modifying the circui

APA, Harvard, Vancouver, ISO, and other styles

50

BERTINI, CESARINO, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS." International Journal of Quantum Information 10, no. 03 (2012): 1250036. http://dx.doi.org/10.1142/s0219749912500360.

Full text

Abstract:

The theory of gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics, where the meaning of a sentence is identified with a system of qubits in a pure or, more generally, mixed state. In this framework, any formula of the language gives rise to a quantum circuit that transforms the state associated to the atomic subformulas into the state associated to the formula and vice versa. On this basis, some holistic semantic situations can be described, where the meaning of whole determines the meaning of the parts, by non-linear and anti-unitary oper

APA, Harvard, Vancouver, ISO, and other styles

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!