Changpeng Shao

Orcid: 0000-0002-3008-7296

According to our database1, Changpeng Shao authored at least 30 papers between 2014 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians.
CoRR, April, 2026

Distinct effects of consumer innovativeness on willingness to pay a green premium when framing social norms information.
Kybernetes, 2026

Quantum spectral method for gradient and Hessian estimation.
J. Comput. Syst. Sci., 2026

Quantum Algorithms for Spectral Sums.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Randomized Quantum Singular Value Transformation.
CoRR, October, 2025

Normalization of Quaternionic Polynomials in Coordinate-Free Quaternionic Variables in Conjugate-Alternating Order.
CoRR, April, 2025

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla.
CoRR, April, 2025

Lower bounds for quantum-inspired classical algorithms via communication complexity.
Quantum, 2025

Normal Forms of Coordinate-Free Quaternionic Polynomials.
Proceedings of the Empowering Novel Geometric Algebra for Graphics and Engineering, 2025

2024
Quantum Communication Complexity of Linear Regression.
ACM Trans. Comput. Theory, March, 2024

Reflective block Kaczmarz algorithms for least squares.
CoRR, 2024

Quantum and Classical Query Complexities of Functions of Matrices.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
A Deterministic Kaczmarz Algorithm for Solving Linear Systems.
SIAM J. Matrix Anal. Appl., March, 2023

An improved quantum algorithm for low-rank rigid linear regressions with vector solution outputs.
CoRR, 2023

2022
Faster Quantum-inspired Algorithms for Solving Linear Systems.
ACM Trans. Quantum Comput., December, 2022

Computing Eigenvalues of Diagonalizable Matrices on a Quantum Computer.
ACM Trans. Quantum Comput., December, 2022

Quantum Algorithms for Learning a Hidden Graph.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance.
Quantum, 2021

2020
Quantum regularized least squares solver with parameter estimate.
Quantum Inf. Process., 2020

A quantum model of feed-forward neural networks with unitary learning algorithms.
Quantum Inf. Process., 2020

Quantum algorithms for learning graphs and beyond.
CoRR, 2020

Quantum algorithms for the polynomial eigenvalue problems.
CoRR, 2020

2019
Quantum speedup of training radial basis function networks.
Quantum Inf. Comput., 2019

Quantum Algorithm Design: Techniques and Applications.
J. Syst. Sci. Complex., 2019

Computing eigenvalues of matrices in a quantum computer.
CoRR, 2019

A simple approach to design quantum neural networks and its applications to kernel-learning methods.
CoRR, 2019

2018
Fast Straightening Algorithm for Bracket Polynomials Based on Tableau Manipulations.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2016
Challenging Theorem Provers with Mathematical Olympiad Problems in Solid Geometry.
Math. Comput. Sci., 2016

2015
Three-Dimensional Projective Geometry with Geometric Algebra.
CoRR, 2015

2014
Reduction among bracket polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014


  Loading...