Rapid solution of problems by quantum computation
From MaRDI portal
Recommendations
Cites work
- Asymmetric encryption and signature method with DNA technology
- Batch proxy quantum blind signature scheme
- Construction of minimal trellises for quantum stabilizer codes
- Demonstration of a Fundamental Quantum Logic Gate
- Differential cryptanalysis of DES-like cryptosystems
- Extended multivariate public key cryptosystems with secure encryption function
- scientific article; zbMATH DE number 708826 (Why is no real title available?)
- scientific article; zbMATH DE number 1759776 (Why is no real title available?)
- scientific article; zbMATH DE number 1568812 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Mixed-state entanglement and quantum error correction
- Most tensor problems are NP-hard
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Protecting Information
- Quantum algorithm to find invariant linear structure of MD hash functions
- Quantum Complexity Theory
- Quantum computation and quantum information. 10th anniversary edition
- Quantum Vernam cipher
- Rapid solution of problems by quantum computation
- Realizable Universal Quantum Logic Gates
- Strengths and Weaknesses of Quantum Computing
- Symmetric-key cryptosystem with DNA technology
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Tensor rank is NP-complete
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
Cited in
(only showing first 100 items - show all)- Quantum zero-error algorithms cannot be composed
- A relation between fidelity and quantum adiabatic evolution
- Reasoning about faulty quantum programs
- From quantum cellular automata to quantum lattice gases
- Solving the Schrödinger equation for the Feynman quantum computer
- On the simulation of quantum Turing machines.
- Realization of Deutsch-like algorithm using ensemble computing
- Preparation of multi-party entanglement of individual photons and atomic ensembles
- Quantum computation based on retarded and advanced propagation.
- The Landauer resistance and band spectra for the counting quantum Turing machine.
- Modelling the brain processes of conscious states
- The behavior of the two-level entangled atom in an optical field
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Physical quantum algorithms
- Efficient quantum algorithms of finding the roots of a polynomial function
- Quantum coherence and geometric quantum discord
- Role of coherence in adiabatic search algorithms
- A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization
- Creating very true quantum algorithms for quantum energy based computing
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
- Quantum iSWAP gate in optical cavities with a cyclic three-level system
- Optimal separation in exact query complexities for Simon's problem
- Quantum algorithm to solve function inversion with time-space trade-off
- Resonant transition-based quantum computation
- Dynamic Grover search: applications in recommendation systems and optimization problems
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Entanglement of the quantum system with spin-spin coupling created by optical excitation
- Quantum correlations and decoherence dynamics for a qutrit-qutrit system under random telegraph noise
- Global multipartite entanglement dynamics in Grover's search algorithm
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Decompositions of n-qubit Toffoli gates with linear circuit complexity
- Quantum teleportation and Grover's algorithm without the wavefunction
- A classical probability space exists for the measurement theory based on the truth values
- Quantum algorithm design: techniques and applications
- Interferometric computation beyond quantum theory
- Efficient quantum algorithm for the parity problem of a certain function
- Quantum key distribution protocol based on modified generalization of Deutsch-Jozsa algorithm in \(d\)-level quantum system
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- Quantum walks: a comprehensive review
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- A quantum computing primer for operator theorists
- Consciousness: Computing the uncomputable
- Quantum communication and complexity.
- Regular languages accepted by quantum automata
- Mathematical models of quantum computation
- A one-way function from thermodynamics and applications to cryptography
- Hypothetical solution of the problem of measurement through the notion of quantum backward causality
- A quantum probability splitter and its application to qubit preparation
- An improved lower bound on query complexity for quantum PAC learning
- Berry phases and entanglement of a two spin-1/2 model with Dzyaloshinski-Moriya interaction in magnetic fields
- On the entanglement and engineering phase gates without dynamical phases for a two-qubit system with Dzyaloshinski-Moriya interaction in magnetic field
- Space-bounded quantum complexity
- Quantum computers and possible wavefunction collapse
- Generalization and demonstration of an entanglement-based Deutsch-jozsa-like algorithm using a 5-qubit quantum computer
- Finite-data-size study on practical universal blind quantum computation
- A model of discrete quantum computation
- Quantum Relief algorithm
- X states of the same spectrum and entanglement as all two-qubit states
- Multipartite entanglement in Grover's search algorithm
- Permutation symmetric hypergraph states and multipartite quantum entanglement
- Implementation of Grover's search algorithm in the QED circuit for two superconducting qubits
- Query complexity of generalized Simon's problem
- Quantum median filter for total variation image denoising
- Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations
- Quantum generative adversarial networks based on Rényi divergences
- Directed graph encoding in quantum computing supporting edge-failures
- Blind quantum machine learning based on quantum circuit model
- Evaluation of exact quantum query complexities by semidefinite programming
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions
- Quantum cryptographic property testing of multi-output Boolean functions
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- Quantum absentminded driver problem revisited
- Combinatorial and rotational quantum abstract detecting systems
- Deterministic algorithms for the hidden subgroup problem
- Probability amplitude-encoded multichannel representation for quantum audio signals
- Multipartite mixed maximally entangled states: mixed states with entanglement 1
- A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dynamical system
- An improved quantum algorithm for the quantum learning with errors problem
- Double sparse quantum state preparation
- Quantum algorithm for learning secret strings and its experimental demonstration
- Design and implementation of MQIR image scaling
- Multiparty multicast schemes for remote state preparation of complex coefficient quantum states via partially entangled channels
- Renormalization of quantum coherence and quantum phase transition in the Ising model
- Query complexity of unitary operation discrimination
- Implementation of Deutsch and Deutsch-Jozsa-like algorithms involving classical entanglement of elastic bits
- Succinct arguments in the quantum random oracle model
- Efficient quantum algorithms related to autocorrelation spectrum
- An exact quantum algorithm for a restricted subtraction game
- Synthesis of Deutsch-Jozsa circuits and verification by IBM Q
- Generalization of Deutsch's algorithm
- Revisiting Deutsch-Jozsa algorithm
- Non-local quantum functions and the distributed Deutsch-Jozsa algorithm
- Non-classicality created by quantum channels with indefinite causal order
- One-dimensional quantum walks with a time and spin-dependent phase shift
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Physics' evolution toward computing
- De-quantisation of the quantum Fourier transform
- Models of quantum computation and quantum programming languages
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
This page was built for publication: Rapid solution of problems by quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033175)
