Quantum computational networks
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Topological quantum computation
- Svetlichny's approach to detecting genuine multipartite entanglement in arbitrarily-high-dimensional systems by a Bell-type inequality
- Quantum algorithms for algebraic problems
- Entangled states implemented by \(B_{n}\) group operators, including properties based on HS decompositions, separability and concurrence
- Quantum Algorithms for Matching and Network Flows
- scientific article; zbMATH DE number 5832281 (Why is no real title available?)
- Analogies and differences between quantum and stochastic automata
- A classical groupoid model for quantum networks
- Committor functions via tensor networks
- Expressiveness of matchgates.
- Exploring \textit{ab initio} machine synthesis of quantum circuits
- A complete graphical calculus for Spekkens' toy bit theory
- Quantum ground–state computation with kinematical gates
- Polynomial time quantum computation with advice
- A new universal and fault-tolerant quantum basis
- Butterfly network coding based on bidirectional hybrid controlled quantum communication
- Quantum conservative many-valued computing
- Mathematical models of quantum computation
- ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
- New dimensions in non‐classical neural computing, part II: quantum, nano, and optical
- Quantum causal modelling
- Complex quantum networks: a topical review
- Primality Test Via Quantum Factorization
- On the simulation of quantum Turing machines.
- Quantum algorithm design: techniques and applications
- NMR quantum computing
- THE CNOT QUANTUM LOGIC GATE USING q-DEFORMED OSCILLATORS
- SQR: a simple quantum representation of infrared images
- Measurement-based universal blind quantum computation with minor resources
- What is quantum computation.
- Noncommutative tori and universal sets of nonbinary quantum gates
- Fermionic quantum computation
- The complexity of iterated reversible computation
- Quantum computing without entanglement
- Quantum Computation over Continuous Variables
- Discrete optimization: a quantum revolution?
- Security comparisons and performance analyses of post-quantum signature algorithms
- Compiling quantum programs
- Realizable Universal Quantum Logic Gates
- The cost of quantum locality
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Holographic software for quantum networks
- Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm
- 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
- Ancilla-driven quantum computation with twisted graph states
- Topological quantum gates in homotopy type theory
- Measurement-based quantum computing with valence-bond-solids
- On circuit models for quantum‐classical networks
- scientific article; zbMATH DE number 5498842 (Why is no real title available?)
- Rotating a qubit
- Quantum communication and complexity.
- The solution of the sixth Hilbert problem: the ultimate Galilean revolution
- Special issue ``Quantum computation complexity theory and quantum network theory (preface)
- Quantum computation with coherent spin states and the close Hadamard problem
- Computations in quantum tensor networks
- Remarks on universal quantum computer
- D-Wave and predecessors: from simulated to quantum annealing
- Models of quantum computation and quantum programming languages
- Parallelizing quantum circuits
- Complexity of protein folding
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- Hyper CNOT and hyper Bell-state analysis assisted by quantum dots in double-side optical microcavities
- Optimization approaches for designing quantum reversible arithmetic logic unit
- Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Entanglement classification in the noninteracting Fermi gas
- Hypercomputation with quantum adiabatic processes
- Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
- Optimized quantum circuit partitioning
- Witnessing causal nonseparability
- NONUNITARY QUANTUM CIRCUIT
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
- Single and biphoton imaging and high dimensional quantum communication
- Geometry and symmetric coherent states of three qubits systems
- ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE
- Quantum computation and quantum information†
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- On the universality of almost every quantum logic gate.
- QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR
- Some algebraic properties of measure-once two-way quantum finite automata
- Nanostructures, Entanglement and the Physics of Quantum Control
- Theoretical computer science: computational complexity
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- PSPACE has constant-round quantum interactive proof systems
- Cluster-state quantum computation
- Measurement-Based and Universal Blind Quantum Computation
- Hierarchy and equivalence of multi-letter quantum finite automata
- Symmetry constraints on temporal order in measurement-based quantum computation
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Generation of elementary gates and Bell's states using controlled adiabatic evolutions
- The one-way quantum computer--a non-network model of quantum computation
- Probability in quantum computation and quantum computational logics: a survey
- A note on quantum sequential machines
- Design of p-valued Deutsch quantum gates with multiple control signals and mixed polarity
- A programming language characterizing quantum polynomial time
- On the circuit paradigm in quantum networks
- Efficient and exact quantum compression
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
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)
