scientific article; zbMATH DE number 2051219
From MaRDI portal
Publication:4453511
zbMATH Open1044.65003arXivquant-ph/0311036MaRDI QIDQ4453511FDOQ4453511
Authors: Stefan Heinrich, Marek Kwas, H. Woźniakowski 
Publication date: 7 March 2004
Full work available at URL: https://arxiv.org/abs/quant-ph/0311036
Title of this publication is not available (Why is that?)
Recommendations
- Sharp error bounds on quantum Boolean summation in various settings
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Average case quantum lower bounds for computing the Boolean mean
- Multi-query quantum sums
- Quantum complexity of Boolean matrix multiplication and related problems
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Optimal quantum query bounds for almost all Boolean functions
- Subset Sum Quantumly in 1.17 n .
- Quantum Query Complexity of Boolean Functions with Small On-Sets
- Quantum summation using \(d\)-level entanglement swapping
performanceerror boundsarithmetic meanBoolean functionquantum summation algorithmworst-average setting
Cited In (18)
- A lightweight three-user secure quantum summation protocol without a third party based on single-particle states
- Secure device-independent quantum bit-wise XOR summation based on a pseudo-telepathy game
- Two-party secure semiquantum summation against the collective-dephasing noise
- Three-party secure semiquantum summation without entanglement among quantum user and classical users
- Multi-party quantum summation within a \(d\)-level quantum system
- Secure three-party quantum summation based on W-class states
- Secure three-party semi-quantum summation using single photons
- Quantum secure multiparty summation based on the phase shifting operation of \(d\)-level quantum system and its application
- Quantum summation using \(d\)-level entanglement swapping
- The quantum setting with randomized queries for continuous problems
- Improvements on: ``Secure multi-party quantum summation based on quantum Fourier transform
- Average case quantum lower bounds for computing the Boolean mean
- Sharp error bounds on quantum Boolean summation in various settings
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- On a problem in quantum summation.
- Secure multi-party quantum summation based on quantum Fourier transform
- Multi-party quantum summation without a trusted third party based on single particles
- A protocol for the secure two-party quantum scalar product
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453511)
