Quantum computational networks
From MaRDI portal
Publication:3033330
DOI10.1098/rspa.1989.0099zbMath0691.68054OpenAlexW2101088258WikidataQ21994539 ScholiaQ21994539MaRDI QIDQ3033330
No author found.
Publication date: 1989
Published in: Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.1989.0099
Related Items
Quantum computation with coherent spin states and the close Hadamard problem, Quantum conservative many-valued computing, Optimization approaches for designing quantum reversible arithmetic logic unit, Hyper CNOT and hyper Bell-state analysis assisted by quantum dots in double-side optical microcavities, A new universal and fault-tolerant quantum basis, Efficient and exact quantum compression, Unnamed Item, Geometry and symmetric coherent states of three qubits systems, Holographic software for quantum networks, Symmetry constraints on temporal order in measurement-based quantum computation, Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report), Design of p-Valued Deutsch Quantum Gates with Multiple Control Signals and Mixed Polarity, MEASUREMENT-BASED QUANTUM COMPUTING WITH VALENCE-BOND-SOLIDS, Polynomial time quantum computation with advice, D-Wave and predecessors: From simulated to quantum annealing, The Toffoli-Hadamard gate system: an algebraic approach, Quantum computing without entanglement, Cluster-state quantum computation, Cost-efficient design of a quantum multiplier-accumulator unit, Computing Boolean Functions via Quantum Hashing, Quantum computer simulation using the CUDA programming model, QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR, ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE, Integrable quantum computation, On the simulation of quantum Turing machines., A dynamic programming approach for distributing quantum circuits by bipartite graphs, Ancilla-driven quantum computation with twisted graph states, \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer, Concurrence for a two-qubits mixed state consisting of three pure states in the framework of SU(2) coherent states, Quantum computing via the Bethe ansatz, Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity, Realization and synthesis of reversible functions, Scheme for directly measuring the concurrences of Collins-Gisin and Werner classes polarization entangled mixed states, Another approach to the equivalence of measure-many one-way quantum finite automata and its application, A geometric algebra perspective on quantum computational gates and universality in quantum computing, Single and biphoton imaging and high dimensional quantum communication, CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME, THE CNOT QUANTUM LOGIC GATE USING q-DEFORMED OSCILLATORS, CONTROLLED QUANTUM SECURE DIRECT COMMUNICATION WITH W STATE, Local Transition Functions of Quantum Turing Machines, Hypercomputation with quantum adiabatic processes, Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state, Quantum algorithm design: techniques and applications, SQR: a simple quantum representation of infrared images, Circuit QED: implementation of the three-qubit refined Deutsch-Jozsa quantum algorithm, Determining the parity of a permutation using an experimental NMR qutrit, Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm, Automatic translation of quantum circuits to optimized one-way quantum computation patterns, On the universality of almost every quantum logic gate, NMR Quantum Computing, Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2, Models of quantum computation and quantum programming languages, WHAT IS QUANTUM COMPUTATION?, Compiling quantum programs, Fermionic quantum computation, Uniformity of quantum circuit families for error-free algorithms, Hierarchy and equivalence of multi-letter quantum finite automata, Majority-based reversible logic gates, The quantum reverse Shannon theorem based on one-shot information theory, Optimized quantum circuit partitioning, Global estimates of errors in quantum computation by the Feynman-Vernon formalism, Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization, The algebraic structure of an approximately universal system of quantum computational gates, Twisted Graph States for Ancilla-driven Universal Quantum Computation, Universality and programmability of quantum computers, Some algebraic properties of measure-once two-way quantum finite automata, Quantum matchgate computations and linear threshold gates, Quantum algorithms for algebraic problems, Quantum information with continuous variables, Information and computation: Classical and quantum aspects, Quantum computation and quantum information†, Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families, Weakly regular quantum grammars and asynchronous quantum automata, Consciousness: Computing the uncomputable, Programmable Hamiltonian for One-way Patterns, Quantum Automata Theory – A Review, Parallelizing quantum circuits, A note on quantum sequential machines, Quantum chaos in quantum Turing machines, Quantum information in the Posner model of quantum cognition, Quantum implicit computational complexity, Quantum random access stored-program machines, The Landauer resistance and band spectra for the counting quantum Turing machine., A framework for structured quantum search., Geometric phases and quantum computations, A theory of computation based on quantum logic. I, ENTANGLEMENT AND QUANTUM PHASE TRANSITION IN A ONE-DIMENSIONAL SYSTEM OF QUANTUM DOTS WITH DISORDER, Quantum communication and complexity., Expressiveness of matchgates., Regular languages accepted by quantum automata, Committor functions via tensor networks, Measurement-based universal blind quantum computation with minor resources, Butterfly network coding based on bidirectional hybrid controlled quantum communication, Mathematical models of quantum computation, Quantum neural networks, Computational complexity of uniform quantum circuit families and quantum Turing machines, Complexity of protein folding, Security comparisons and performance analyses of post-quantum signature algorithms, PSPACE has constant-round quantum interactive proof systems, A complete graphical calculus for Spekkens' toy bit theory, Topological quantum computation, NONUNITARY QUANTUM CIRCUIT, Noncommutative tori and universal sets of nonbinary quantum gates, Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels, A programming language characterizing quantum polynomial time, Universal Classical Optical Computing Inspired by Quantum Information Process, Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability, Quantum traveler's dilemma and the role of non-maximal entanglement, Lattice-valued general orthomodular automata, Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования, Entanglement classification in the noninteracting Fermi gas, Distributed Grover's algorithm, ANALYSIS OF QUANTUM FUNCTIONS, QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES, Witnessing causal nonseparability, Svetlichny’s approach to detecting genuine multipartite entanglement in arbitrarily-high-dimensional systems by a Bell-type inequality, A UNIVERSAL QUANTUM ESTIMATOR, The solution of the sixth Hilbert problem: the ultimate Galilean revolution, Revisiting the simulation of quantum Turing machines by quantum circuits, Loop quantum gravity’s boundary maps, Measurement-Based and Universal Blind Quantum Computation, Probability in quantum computation and quantum computational logics: a survey, ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES, Rotating a qubit, Remarks on universal quantum computer, Analogies and differences between quantum and stochastic automata, Quasiclassical computation, How does adiabatic quantum computation fit into quantum automata theory?, Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer, MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES, New dimensions in non‐classical neural computing, part II: quantum, nano, and optical, The one-way quantum computer--a non-network model of quantum computation, HADAMARD TYPE OPERATIONS FOR QUBITS, Generation of elementary gates and Bell’s states using controlled adiabatic evolutions, Entangled states implemented by Bngroup operators, including properties based on HS decompositions, separability and concurrence, TOOLS FOR QUANTUM ALGORITHMS, Primality Test Via Quantum Factorization, Nanostructures, Entanglement and the Physics of Quantum Control, Realizable Universal Quantum Logic Gates, Demonstration of a Fundamental Quantum Logic Gate, Measurement of Conditional Phase Shifts for Quantum Logic, Can a Universal Quantum Computer Be Fully Quantum?, Quantum Games and Quantum Strategies, Quantum Computation over Continuous Variables, Quantum causal modelling, Optimal quantum networks and one-shot entropies, A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY, Quantum-computing with AI & blockchain: modelling, fault tolerance and capacity scheduling
