As noted by Lance, the new journal ACM Transactions on Computation Theory is now accepting papers. Note for quantum computing theorists:
ACM Transactions on Computation Theory will cover theoretical computer science complementing the scope of the ACM Transactions on Algorithms and the ACM Transactions on Computational Logic including, but not limited to, computational complexity, foundations of cryptography, randomness in computing, coding theory, models of computation including parallel, distributed and quantum and other emerging models, computational learning theory, theoretical computer science aspects of areas such as databases, information retrieval, economic models and networks.
So next time you write a paper which involves QMA, the Hidden Subgroup, etc. etc. make sure to give ToCT a look!
Categories
- Log in to post comments
More like this
The 5th Conference on the Theory of Quantum Computation, Communication and Cryptography has put up its first announcement. It will be held at the University of Leeds, United Kingdom, from 13th - 15th April 2010. The first upcoming deadline to be aware of is the submission deadline of Monday…
"The miracle of the appropriateness of the language of mathematics for the formulation of the laws of physics is a wonderful gift which we neither understand nor deserve." - E. P. Wigner
Our universe, or at least our understanding of the universe, appears to allow us to see its naked underbelly…
Dan Reed has a brief note up about a new group at Microsoft the extreme computing group (XCG) which includes among its subject areas quantum computing:
XCG was formed in June 2009 with the goal of developing radical new approaches to ultrascale and high-performance computing hardware and software.…
The survey of abused words in quantum computing shows the word "exponential" as having an, um, exponential, lead over its competitors. My own personal choice for the most abused word was "scalable," a word that is, in my opinion, the least debated, but most important, concept in quantum computing…
This is quite useful! Thanks for the post.