Models in quantum computing: a systematic review
From MaRDI portal
Publication:2687125
DOI10.1007/s11128-021-03021-3OpenAlexW3132013874MaRDI QIDQ2687125
Benjamin Asubam Weyori, Adebayo Felix Adekoya, Peter Nimbe
Publication date: 1 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03021-3
quantum computingquantum automataquantum statesquantum circuitsquantum neural networksmodel of computation
Related Items (3)
Fast and scalable quantum computing simulation on multi-core and many-core platforms ⋮ Realization of the Hadamard gate based on superposition of the composite solitons ⋮ Mapping a logical representation of TSP to quantum annealing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Classical Complexity of Boson Sampling
- On the first moment of the Gauss sum
- On general partial Gaussian sums
- Picturing classical and quantum Bayesian inference
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- Practical integer-to-binary mapping for quantum annealers
- Geometric quantum computing and dissipation models
- Reconstruction of quantum states of spin systems: From quantum Bayesian inference to quantum tomography
- Quantum neural networks
- On the quartic Gauss sums and their recurrence property
- Quantum algorithm for triangle finding in sparse graphs
- An introduction to quantum and Vassiliev knot invariants
- Quantum models of Parrondo's games
- Quantum Ising phases and transitions in transverse Ising models
- A quantum annealing approach to biclustering
- Element distinctness revisited
- Embedding equality constraints of optimization problems into a quantum annealer
- A case study in programming a quantum annealer for hard operational planning problems
- Evolution of quantum observables: from non-commutativity to commutativity
- Extended learning graphs for triangle finding
- A conditional generative model based on quantum circuit and classical optimization
- Analyzing the quantum annealing approach for solving linear least squares problems
- On hybrid models of quantum finite automata
- Building an iterative heuristic solver for a quantum annealer
- Ancilla models for quantum operations: for what unitaries does the ancilla state have to be physical?
- Quantum image processing?
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Quantum perceptron over a field and neural network architecture selection in a quantum computer
- A quantum-Bayesian route to quantum-state space
- Quantum complexity of testing group commutativity
- Solving systems of linear algebraic equations via unitary transformations on quantum processor of IBM quantum experience
- Quantum image restoration based on Hudson-Parthasarathy Schrödinger equation
- A quantum Richardson-lucy image restoration algorithm based on controlled rotation operation and Hamiltonian evolution
- Efficient Algorithms for Universal Quantum Simulation
- Colloquium: Quantum annealing and analog quantum computation
- Quantum annealing with antiferromagnetic transverse interactions for the Hopfield model
- What Can Be Observed Locally?
- Keyring models: An approach to steerability
- Philosophy and the practice of Bayesian statistics
- Open quantum generalisation of Hopfield neural networks
- Presheaf Models of Quantum Computation: An Outline
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Quantum information and computation
- Integrated Devices for Quantum Information with Polarization Encoded Qubits
- The computational complexity of linear optics
- How fast can quantum annealers count?
- Encyclopedia of Algorithms
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
This page was built for publication: Models in quantum computing: a systematic review
