Quantum computational networks
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Some algebraic properties of measure-once two-way quantum finite automata
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Weakly regular quantum grammars and asynchronous quantum automata
- Parallelizing quantum circuits
- A note on quantum sequential machines
- Quantum implicit computational complexity
- Complexity of protein folding
- On the simulation of quantum Turing machines.
- Hypercomputation with quantum adiabatic processes
- Quantum chaos in quantum Turing machines
- The Landauer resistance and band spectra for the counting quantum Turing machine.
- A framework for structured quantum search.
- Quantum neural networks
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Holographic software for quantum networks
- Decompositions of n-qubit Toffoli gates with linear circuit complexity
- Scheme for directly measuring the concurrences of Collins-Gisin and Werner classes polarization entangled mixed states
- Quantum algorithm design: techniques and applications
- Uniformity of quantum circuit families for error-free algorithms
- Majority-based reversible logic gates
- Consciousness: Computing the uncomputable
- Geometric phases and quantum computations
- Quantum communication and complexity.
- Expressiveness of matchgates.
- Regular languages accepted by quantum automata
- Mathematical models of quantum computation
- PSPACE has constant-round quantum interactive proof systems
- Computations in quantum tensor networks
- Integrable quantum computation
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Optimized quantum circuit partitioning
- Quantum random access stored-program machines
- Committor functions via tensor networks
- Measurement-based universal blind quantum computation with minor resources
- Butterfly network coding based on bidirectional hybrid controlled quantum communication
- Security comparisons and performance analyses of post-quantum signature algorithms
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Special issue ``Quantum computation complexity theory and quantum network theory (preface)
- Models of quantum computation and quantum programming languages
- Hierarchy and equivalence of multi-letter quantum finite automata
- Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization
- Quantum information in the Posner model of quantum cognition
- Efficient and exact quantum compression
- Quantum computation with programmable connections between gates
- Polynomial time quantum computation with advice
- Cost-efficient design of a quantum multiplier-accumulator unit
- Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state
- Compiling quantum programs
- Universality and programmability of quantum computers
- A theory of computation based on quantum logic. I
- A complete graphical calculus for Spekkens' toy bit theory
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer
- A possible strategy to defeat decoherence in quantum computation: the role of symmetries, dynamical algebras, and all that.
- Local transition functions of quantum Turing machines
- On the universality of almost every quantum logic gate.
- What is quantum computation.
- Twisted graph states for ancilla-driven universal quantum computation
- Programmable Hamiltonian for one-way patterns
- Quantum computation with coherent spin states and the close Hadamard problem
- Measurement-based quantum computing with valence-bond-solids
- D-Wave and predecessors: from simulated to quantum annealing
- 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
- Computing Boolean functions via quantum hashing
- A new universal and fault-tolerant quantum basis
- Geometry and symmetric coherent states of three qubits systems
- Quantum ground–state computation with kinematical gates
- scientific article; zbMATH DE number 5832281 (Why is no real title available?)
- 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 automata theory -- a review
- Design of gates for quantum computation: the NOT gate
- Design of p-valued Deutsch quantum gates with multiple control signals and mixed polarity
- Symmetry constraints on temporal order in measurement-based quantum computation
- Revealing advantage in a quantum network
- Quantum computation and quantum information†
- ENTANGLEMENT AND QUANTUM PHASE TRANSITION IN A ONE-DIMENSIONAL SYSTEM OF QUANTUM DOTS WITH DISORDER
- QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR
- ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE
- 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
- NMR quantum computing
- Measurement-Based and Universal Blind Quantum Computation
- The Toffoli-Hadamard gate system: an algebraic approach
- MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
- New dimensions in non‐classical neural computing, part II: quantum, nano, and optical
- Ancilla-driven quantum computation with twisted graph states
- Quantum gates and circuits
- 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
- Quantum gate arrays as coherent sums over classical logic gate arrays
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- Single and biphoton imaging and high dimensional quantum communication
- The one-way quantum computer--a non-network model of quantum computation
- TOOLS FOR QUANTUM ALGORITHMS
This page was built for publication: Quantum computational networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033330)
